On Logics and Homomorphism Closure

Predicate logic is the premier choice for specifying classes of relational structures. Homomorphisms are key to describing correspondences between relational structures. Questions concerning the interdependencies between these two means of characterizing (classes of) structures are of fundamental in...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science s. 1 - 13
Hlavní autori: Bodirsky, Manuel, Feller, Thomas, Knauer, Simon, Rudolph, Sebastian
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 29.06.2021
Predmet:
Analytical models
Complexity theory
Computational modeling
Computer science
Fasteners
Inspection
Syntactics
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Predicate logic is the premier choice for specifying classes of relational structures. Homomorphisms are key to describing correspondences between relational structures. Questions concerning the interdependencies between these two means of characterizing (classes of) structures are of fundamental interest and can be highly non-trivial to answer. We investigate several problems regarding the homomorphism closure (homclosure) of the class of all (finite or arbitrary) models of logical sentences: membership of structures in a sentence's homclosure; sentence homclosedness; homclosure characterizability in a logic; normal forms for homclosed sentences in certain logics. For a wide variety of fragments of first- and second-order predicate logic, we clarify these problems' computational properties.
AbstractList Predicate logic is the premier choice for specifying classes of relational structures. Homomorphisms are key to describing correspondences between relational structures. Questions concerning the interdependencies between these two means of characterizing (classes of) structures are of fundamental interest and can be highly non-trivial to answer. We investigate several problems regarding the homomorphism closure (homclosure) of the class of all (finite or arbitrary) models of logical sentences: membership of structures in a sentence's homclosure; sentence homclosedness; homclosure characterizability in a logic; normal forms for homclosed sentences in certain logics. For a wide variety of fragments of first- and second-order predicate logic, we clarify these problems' computational properties.
Author Knauer, Simon
Feller, Thomas
Rudolph, Sebastian
Bodirsky, Manuel
Author_xml – sequence: 1
  givenname: Manuel
  surname: Bodirsky
  fullname: Bodirsky, Manuel
  organization: Institut für Algebra TU Dresden
– sequence: 2
  givenname: Thomas
  surname: Feller
  fullname: Feller, Thomas
  organization: Computational Logic Group TU Dresden
– sequence: 3
  givenname: Simon
  surname: Knauer
  fullname: Knauer, Simon
  organization: Institut für Algebra TU Dresden
– sequence: 4
  givenname: Sebastian
  surname: Rudolph
  fullname: Rudolph, Sebastian
  organization: Computational Logic Group TU Dresden
BookMark eNotj81Kw0AURkdQUNs8gSDBfeK9d_6XEtQWAl1o12U6uaORJikZXfj2Fizf4nA2B75bcTlOIwtxj1Ajgn9s182bJjKqJiCsvbKgES9E4a1DY7RSzmtzLYqcvwCAnEVQ_kY8bMaynT76mMswduVqGk6bj599HsrmMOWfmZfiKoVD5uLMhdi-PL83q6rdvK6bp7YK5Px31YVEHcCeZEyBbQxotO2ckYmDdYmllclERK_wJFKz9SB57x0yRZJOLsTdf7dn5t1x7ocw_-7OT-Qfstk_-g
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/LICS52264.2021.9470511
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9781665448956
1665448954
EndPage 13
ExternalDocumentID 9470511
Genre orig-research
GrantInformation_xml – fundername: European Research Council
  funderid: 10.13039/501100000781
GroupedDBID 6IE
6IH
ACM
ALMA_UNASSIGNED_HOLDINGS
APO
CBEJK
GUFHI
LHSKQ
RIE
RIO
ID FETCH-LOGICAL-a289t-daf2d00b23cfae7ca1657d863fea78fe373f6c11941fe335e7903eb981e2c2383
IEDL.DBID RIE
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000947350400004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:26:38 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a289t-daf2d00b23cfae7ca1657d863fea78fe373f6c11941fe335e7903eb981e2c2383
PageCount 13
ParticipantIDs ieee_primary_9470511
PublicationCentury 2000
PublicationDate 2021-June-29
PublicationDateYYYYMMDD 2021-06-29
PublicationDate_xml – month: 06
  year: 2021
  text: 2021-June-29
  day: 29
PublicationDecade 2020
PublicationTitle Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science
PublicationTitleAbbrev LICS
PublicationYear 2021
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0002871049
Score 2.1845274
Snippet Predicate logic is the premier choice for specifying classes of relational structures. Homomorphisms are key to describing correspondences between relational...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Analytical models
Complexity theory
Computational modeling
Computer science
Fasteners
Inspection
Syntactics
Title On Logics and Homomorphism Closure
URI https://ieeexplore.ieee.org/document/9470511
WOSCitedRecordID wos000947350400004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlR3LSgMxcKjFg6eqrfgmiEe33Wx2N8m5WCqUWlCht5ImEyjYXenD7zezXSuCF8klCYQwkwnzngG4J1cSz9FTfTsVpS5xUaASHXmfmcBfY2N8VWd2JMdjNZ3qSQMe9rkwiFgFn2GXppUv35V2S6aynk5loKGg6xxIme9ytfb2FJL8g7RbJwHzWPdGT_0Xki7IcpLwbn34VxeViokMWv-7_hg6P9l4bLLnMyfQwOIUWt_tGFj9O9tw91wwap1s18wUjg3LZRgBjYv1kvXfSzIFduBt8PjaH0Z1C4TIBE1oEznjExfH80RYb1Baw_NMOpULj0Yqj0IKn1vOdcrDQmQodSxwrhXHxAZuLM6gWZQFngNDJ-ZGeKOo5p12sfIyoM2j9amU6LILaBPIs49dlYtZDe3l39tXcERYpaCpRF9Dc7Pa4g0c2s_NYr26rZ7mC7_0jkQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlR1dS8Mw8BhT0Kepm_htEB_tljRt0zwPx4Z1Dpywt5ElFxi4Vvbh7zfp6kTwRfKSBAK5y4X7vgO4964klqD19e3SIDKhCRyVyMDaWDn-SpWyZZ3ZTAyH6WQiRzV42OXCIGIZfIZtPy19-abQG28q68hIOBpyus5eHEUh3WZr7SwqXvZ38m6VBsyo7GSD7quXL7ztJGTt6vivPiolG-k1_neBI2j95OOR0Y7THEMN8xNofDdkINX_bMLdS05882S9Iio3pF8s3HCInK8WpPteeGNgC956j-NuP6iaIATK6ULrwCgbGkpnIddWodCKJbEwacItKpFa5ILbRDMmI-YWPEYhKceZTBmG2vFjfgr1vMjxDAgaPlPcqtRXvZOGplY4tFnUNhICTXwOTQ_y9GNb52JaQXvx9_YtHPTHz9k0GwyfLuHQY9iHUIXyCurr5QavYV9_ruer5U35TF9aD5GL
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+the+36th+Annual+ACM%2FIEEE+Symposium+on+Logic+in+Computer+Science&rft.atitle=On+Logics+and+Homomorphism+Closure&rft.au=Bodirsky%2C+Manuel&rft.au=Feller%2C+Thomas&rft.au=Knauer%2C+Simon&rft.au=Rudolph%2C+Sebastian&rft.date=2021-06-29&rft.pub=IEEE&rft.spage=1&rft.epage=13&rft_id=info:doi/10.1109%2FLICS52264.2021.9470511&rft.externalDocID=9470511