Help Privacy Policy Disclaimer
  Advanced SearchBrowse





Decidability Results for Saturation-based Model Building


Horbach,  Matthias
Automation of Logic, MPI for Informatics, Max Planck Society;


Weidenbach,  Christoph       
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

(Any fulltext), 355KB

Supplementary Material (public)
There is no public supplementary material available

Horbach, M., & Weidenbach, C.(2009). Decidability Results for Saturation-based Model Building (MPI-I-2009-RG1-004). Saarbrücken: Max-Planck-Institut für Informatik. Retrieved from http://domino.mpi-inf.mpg.de/internet/reports.nsf/NumberView/2009-RG1-004.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-6659-B
Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termination without generating an empty clause, a saturated clause set implicitly represents a minimal model for all clauses, based on the underlying term ordering of the superposition calculus. In general, it is not decidable whether a ground atom, a clause or even a formula holds in this minimal model of a satisfiable saturated clause set. Based on an extension of our superposition calculus for fixed domains with syntactic disequality constraints in a non-equational setting, we describe models given by ARM (Atomic Representations of term Models) or DIG (Disjunctions of Implicit Generalizations) representations as minimal models of finite saturated clause sets. This allows us to present several new decidability results for validity in such models. These results extend in particular the known decidability results for ARM and DIG representations.