Theory of generalized annotated logic programming and its applications
Journal of Logic Programming
Finite domain constraint solving and constraint logic programming
Constraint logic programming
A logic for reasoning with inconsistency
Journal of Automated Reasoning
Automated deduction in multiple-valued logics
Automated deduction in multiple-valued logics
JELIA '96 Proceedings of the European Workshop on Logics in Artificial Intelligence
MGTP: A Model Generation Theorem Prover - Its Advanced Features and Applications
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Interval Constraint Logic Programming
Selected Papers from Constraint Programming: Basics and Trends
CHRv: A Flexible Query Language
FQAS '98 Proceedings of the Third International Conference on Flexible Query Answering Systems
A Model Generation Based Theorem Prover MGTP for First-Order Logic
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
| Hi-index | 0.00 |
Model generation theorem proving (MGTP) is a class of deduction procedures for first-order logic that were successfully used to solve hard combinatorial problems. For some applications the representation of models in MGTP and its extension CMGTP is too redundant. Here we suggest to extend members of model candidates in such a way that a predicate p can have not only terms as arguments, but at certain places also subsets of totally ordered finite domains. The ensuing language and deduction system relies on constraints based on finite intervals in totally ordered sets and is called IV-MGTP. It is related to constraint programming and many-valued logic, but differs significantly from either. We show soundness and completeness of IV-MGTP. First results with our implementation show considerable potential of the method.