SAT-Inspired Higher-Order Eliminations

We generalize several propositional preprocessing techniques to higher-order logic, building on existing first-order generalizations. These techniques eliminate literals, clauses, or predicate symbols from the problem, with the aim of making it more amenable to automatic proof search. We also introd...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Logical methods in computer science Jg. 19, Issue 2
Hauptverfasser: Blanchette, Jasmin, Vukmirović, Petar
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Logical Methods in Computer Science e.V 08.05.2023
Schlagworte:
computer science - logic in computer science
ISSN:1860-5974, 1860-5974
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract We generalize several propositional preprocessing techniques to higher-order logic, building on existing first-order generalizations. These techniques eliminate literals, clauses, or predicate symbols from the problem, with the aim of making it more amenable to automatic proof search. We also introduce a new technique, which we call quasipure literal elimination, that strictly subsumes pure literal elimination. The new techniques are implemented in the Zipperposition theorem prover. Our evaluation shows that they sometimes help prove problems originating from Isabelle formalizations and the TPTP library.
AbstractList We generalize several propositional preprocessing techniques to higher-order logic, building on existing first-order generalizations. These techniques eliminate literals, clauses, or predicate symbols from the problem, with the aim of making it more amenable to automatic proof search. We also introduce a new technique, which we call quasipure literal elimination, that strictly subsumes pure literal elimination. The new techniques are implemented in the Zipperposition theorem prover. Our evaluation shows that they sometimes help prove problems originating from Isabelle formalizations and the TPTP library.
We generalize several propositional preprocessing techniques to higher-order logic, building on existing first-order generalizations. These techniques eliminate literals, clauses, or predicate symbols from the problem, with the aim of making it more amenable to automatic proof search. We also introduce a new technique, which we call quasipure literal elimination, that strictly subsumes pure literal elimination. The new techniques are implemented in the Zipperposition theorem prover. Our evaluation shows that they sometimes help prove problems originating from Isabelle formalizations and the TPTP library.
Author Blanchette, Jasmin
Vukmirović, Petar
Author_xml – sequence: 1
  givenname: Jasmin
  surname: Blanchette
  fullname: Blanchette, Jasmin
– sequence: 2
  givenname: Petar
  surname: Vukmirović
  fullname: Vukmirović, Petar
BookMark eNpNkEtLAzEUhYNUsNb-AHddiS6iuUlmJnFXSrUDhS6s63Anj5oynSlJN_57-xDxwuEezuJbfLdk0PWdJ-Qe2LMsuVYv7c5mCvqRv-onzri4IkNQJaOFruTgX78h45y37HhCgOLlkDx8TNe07vI-Ju8mi7j58omukvNpMm_jLnZ4iH2X78h1wDb78e8fkc-3-Xq2oMvVez2bLqnlHASVLjQKFdrG6YKhlRX4ItjAqwpcACVLkE3QFqoySO9BVIiuRIYuFKqoUIxIfeG6Hrdmn-IO07fpMZrz0KeNwXSItvWmYMo6ZpumDCitEI0DL6RyRZBMB3ZiwYVlU59z8uGPB8ycvZmTNwPacHPM0Zv4AZMBYt8
ContentType Journal Article
DBID AAYXX
CITATION
DOA
DOI 10.46298/lmcs-19(2:9)2023
DatabaseName CrossRef
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1860-5974
ExternalDocumentID oai_doaj_org_article_508cd0cbb6fa4c33bd1e348d5f409f0a
10_46298_lmcs_19_2_9_2023
GroupedDBID .4S
.DC
29L
2WC
5GY
5VS
AAFWJ
AAYXX
ADBBV
ADMLS
ADQAK
AENEX
AFPKN
ALMA_UNASSIGNED_HOLDINGS
ARCSS
BCNDV
CITATION
EBS
EJD
FRP
GROUPED_DOAJ
J9A
KQ8
MK~
ML~
M~E
OK1
OVT
P2P
TR2
TUS
XSB
ID FETCH-LOGICAL-c2213-4dfb8a8acbd950ac471e5fcf2771df184614bf9c176f4ee137aad6a0adf5857a3
IEDL.DBID DOA
ISSN 1860-5974
IngestDate Fri Oct 03 12:51:35 EDT 2025
Sat Nov 29 06:21:52 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License https://creativecommons.org/licenses/by/4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c2213-4dfb8a8acbd950ac471e5fcf2771df184614bf9c176f4ee137aad6a0adf5857a3
OpenAccessLink https://doaj.org/article/508cd0cbb6fa4c33bd1e348d5f409f0a
ParticipantIDs doaj_primary_oai_doaj_org_article_508cd0cbb6fa4c33bd1e348d5f409f0a
crossref_primary_10_46298_lmcs_19_2_9_2023
PublicationCentury 2000
PublicationDate 2023-05-08
PublicationDateYYYYMMDD 2023-05-08
PublicationDate_xml – month: 05
  year: 2023
  text: 2023-05-08
  day: 08
PublicationDecade 2020
PublicationTitle Logical methods in computer science
PublicationYear 2023
Publisher Logical Methods in Computer Science e.V
Publisher_xml – name: Logical Methods in Computer Science e.V
SSID ssj0000331826
Score 2.2681937
Snippet We generalize several propositional preprocessing techniques to higher-order logic, building on existing first-order generalizations. These techniques...
We generalize several propositional preprocessing techniques to higher-order logic, building on existing first-order generalizations. These techniques...
SourceID doaj
crossref
SourceType Open Website
Index Database
SubjectTerms computer science - logic in computer science
Title SAT-Inspired Higher-Order Eliminations
URI https://doaj.org/article/508cd0cbb6fa4c33bd1e348d5f409f0a
Volume 19, Issue 2
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: DOA
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources (ISSN International Center)
  customDbUrl:
  eissn: 1860-5974
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000331826
  issn: 1860-5974
  databaseCode: M~E
  dateStart: 20040101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NS8MwFA8yPHjxW5xf9CCiQljbpE3ibcqGgk7BKbuFfIIwq2zTo3-7L2kn8-TFQ3MozSP9vbTv98jj_RA6ZqnRKk8t1h7cQB0VmFuhYPBa0VAxFkX7nm_ZYMBHI_GwIPUVasLq9sA1cB0gEMaCQV16RQ0h2maOUG4LD5mJTyM1AtazkEzFfzAhgTjXx5i0zAXvjF_NFGfiNL8QZ0Ez_FcgWujXHwNLfx2tNoww6dYr2UBLrtpEa3O1haT5-LbQyWN3iG-qcDLubFLXZ-D70Dkz6Y2jNlfcQtvoqd8bXl3jRuUAmzzPCKaACldcGW1FkSoD0cIV3vicscx6SMAggGovTMZKT53LCFPKlipV1gPVZ4rsoFb1VrldlABf0qrgThfaUO-94DABDFilhQXo2-h8_sryvW5mISEJiPjIgI_MhMwlXIBPG10GUH4eDH2o4w3wjmy8I__yzt5_GNlHK2FBscyQH6DWbPLhDtGy-Zy9TCdH0fEw3n31vgHPNbXp
linkProvider Directory of Open Access Journals
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%3Ajournal&rft.genre=article&rft.atitle=SAT-Inspired+Higher-Order+Eliminations&rft.jtitle=Logical+methods+in+computer+science&rft.au=Jasmin+Blanchette&rft.au=Petar+Vukmirovi%C4%87&rft.date=2023-05-08&rft.pub=Logical+Methods+in+Computer+Science+e.V&rft.eissn=1860-5974&rft.volume=19%2C+Issue+2&rft_id=info:doi/10.46298%2Flmcs-19%282%3A9%292023&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_508cd0cbb6fa4c33bd1e348d5f409f0a
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1860-5974&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1860-5974&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1860-5974&client=summon