Explicit representation of terms defined by counter examples
Journal of Automated Reasoning
Automatic proofs by induction in theories without constructors
Information and Computation
Sufficient-completeness, ground-reducibility and their complexity
Acta Informatica
A non-ground realization of the stable and well-founded semantics
Theoretical Computer Science
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Working with ARMs: complexity results on atomic representations of herbrand models
Information and Computation
Explicit versus implicit representations of subsets of the Herbrand universe
Theoretical Computer Science
Automated Theorem Proving Proof and Model Generation with Disconnection Tableaux
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Extending Resolution for Model Construction
JELIA '90 Proceedings of the European Workshop on Logics in AI
Modular Logic Programming and Generalized Quantifiers
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
The Disconnection Method - A Confluent Integration of Unification in the Analytic Framework
TABLEAUX '96 Proceedings of the 5th International Workshop on Theorem Proving with Analytic Tableaux and Related Methods
CSL '92 Selected Papers from the Workshop on Computer Science Logic
Solving Disequations in Equational Theories
Proceedings of the 9th International Conference on Automated Deduction
An Improved Lower Bound for the Elementary Theories of Trees
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Model elimination and connection tableau procedures
Handbook of automated reasoning
Living Book -- Deduction, Slicing, and Interaction
Journal of Automated Reasoning
Extending semantic resolution via automated model building: applications
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
The model evolution calculus as a first-order DPLL method
Artificial Intelligence
Automated Model Building: From Finite to Infinite Models
Proceedings of the 9th AISC international conference, the 15th Calculemas symposium, and the 7th international MKM conference on Intelligent Computer Mathematics
Constructing infinite models represented by tree automata
Annals of Mathematics and Artificial Intelligence
CADE'11 Proceedings of the 23rd international conference on Automated deduction
Model representation over finite and infinite signatures
JELIA'06 Proceedings of the 10th European conference on Logics in Artificial Intelligence
| Hi-index | 0.00 |
Some results on expressibility and complexity issues in model representation are presented. In particular, the relation between so-called ‘contexts' as recently introduced in [4] for the model evolution calculus and the more traditional ‘disjunctions of implicit generalizations' (DIGs) [21] is clarified: contexts are as expressible as DIGs, but DIGs may represent the same model exponentially more succinctly. The clause evaluation problem and the equivalence problem for DIGs and contexts, respectively, are all shown to be coNP-complete.