Please use this identifier to cite or link to this item:
https://research.matf.bg.ac.rs/handle/123456789/471
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Nikolić, Mladen | en_US |
dc.contributor.author | Janičić, Predrag | en_US |
dc.date.accessioned | 2022-08-13T09:51:51Z | - |
dc.date.available | 2022-08-13T09:51:51Z | - |
dc.date.issued | 2012-08-17 | - |
dc.identifier.isbn | 9783642313738 | - |
dc.identifier.issn | 03029743 | en |
dc.identifier.uri | https://research.matf.bg.ac.rs/handle/123456789/471 | - |
dc.description.abstract | We present a new, CDCL-based approach for automated theorem proving in coherent logic - an expressive semi-decidable fragment of first-order logic that provides potential for obtaining human readable and machine verifiable proofs. The approach is described by means of an abstract state transition system, inspired by existing transition systems for SAT and represents its faithful lifting to coherent logic. The presented transition system includes techniques from which CDCL SAT solvers benefited the most (backjumping and lemma learning), but also allows generation of human readable proofs. In contrast to other approaches to theorem proving in coherent logic, reasoning involved need not to be ground. We prove key properties of the system, primarily that the system yields a semidecision procedure for coherent logic. As a consequence, the semidecidability of another fragment of first order logic which is a proper superset of coherent logic is also proven. © 2012 Springer-Verlag. | en |
dc.relation.ispartof | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | en_US |
dc.subject | abstract state transition systems | en |
dc.subject | CDCL SAT solving | en |
dc.subject | coherent logic | en |
dc.subject | machine verifiable proofs | en |
dc.subject | readable proofs | en |
dc.title | CDCL-based abstract state transition system for coherent logic | en_US |
dc.type | Conference Paper | en_US |
dc.relation.publication | International Conference on Intelligent Computer Mathematics CICM 2012 | en_US |
dc.identifier.doi | 10.1007/978-3-642-31374-5_18 | - |
dc.identifier.scopus | 2-s2.0-84864920045 | - |
dc.identifier.url | https://api.elsevier.com/content/abstract/scopus_id/84864920045 | - |
dc.contributor.affiliation | Informatics and Computer Science | en_US |
dc.contributor.affiliation | Informatics and Computer Science | en_US |
dc.relation.firstpage | 264 | en_US |
dc.relation.lastpage | 279 | en_US |
dc.relation.volume | 7362 LNAI | en_US |
item.fulltext | No Fulltext | - |
item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
item.cerifentitytype | Publications | - |
item.grantfulltext | none | - |
item.openairetype | Conference Paper | - |
crisitem.author.dept | Informatics and Computer Science | - |
crisitem.author.dept | Informatics and Computer Science | - |
crisitem.author.orcid | 0000-0001-8922-4948 | - |
Appears in Collections: | Research outputs |
SCOPUSTM
Citations
2
checked on Dec 18, 2024
Page view(s)
11
checked on Dec 24, 2024
Google ScholarTM
Check
Altmetric
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.