2014/06/02 by Mnacho Echenim, Echenim, Mnacho, Nicolas Peltier +1
Computer Science · #03B10 #03B35 #68T27 #Artificial Intelligence (cs.AI) #F.3.1 #F.4.1 #FOS: Computer and information sciences #I.2.2 #I.2.3 #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #Semantic Web and Ontologies #acm:03B10 #acm:03B35 #acm:68T27 #cs.AI #cs.LO #msc:03B10 #msc:03B35 #msc:68T27
paper · pdf · doi:10.48550/arxiv.1406.0303
openalex publication_date 2014/06/02 · arxiv created 2014/07/13 · arxiv updated 2014/07/15 · openalex created_date 2019/06/27 · openalex updated_date 2026/07/28
We present a modification of the superposition calculus that is meant to generate consequences of sets of first-order axioms. This approach is proven to be sound and deductive-complete in the presence of redundancy elimination rules, provided the considered consequences are built on a given finite set of ground terms, represented by constant symbols. In contrast to other approaches, most existing results about the termination of the superposition calculus can be carried over to our procedure. This ensures in particular that the calculus is terminating for many theories of interest to the SMT community.