Access the full text.
Sign up today, get DeepDyve free for 14 days.
R. Pichler (2000)
The Explicit Representability of Implicit Generalizations
C. Fermüller, A. Leitsch (1996)
Hyperresolution and Automated Model BuildingJ. Log. Comput., 6
Hubert Comon-Lundh, Catherine Delor (1994)
Equational Formulae with Membership ConstraintsInf. Comput., 112
R. Caferra, N. Peltier (1995)
Decision Procedures Using Model Building Techniques
J. Delgrande, Torsten Schaub, H. Tompits, S. Woltran (2001)
On Computing Solutions to Belief Change Scenarios
R. Pichler (1998)
On the Complexity of H-Subsumption
J. Siekmann, G. Wrightson (1983)
Automation of Reasoning: Classical Papers in Computational Logic 1967–1970
Rainer Feldmann, B. Monien, Stefan Schamberger (2000)
A Distributed Algorithm to Evaluate Quantified Boolean Formulae
D. Plaisted, Steven Greenbaum (1986)
A Structure-Preserving Clause Form TranslationJ. Symb. Comput., 2
A. Martelli, U. Montanari (1982)
An Efficient Unification AlgorithmACM Trans. Program. Lang. Syst., 4
Henry Kautz, B. Selman (1992)
Planning as Satisfiability
M. Moskewicz, Conor Madigan, Ying Zhao, Lintao Zhang, S. Malik (2001)
Chaff: engineering an efficient SAT solverProceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232)
Hantao Zhang (1997)
SATO: An Efficient Propositional Prover
G. Gottlob, R. Pichler (1999)
Working with arms: Complexity results on atomic representations of Herbrand modelsProceedings. 14th Symposium on Logic in Computer Science (Cat. No. PR00158)
J. Rintanen (1999)
Constructing Conditional Plans by a Theorem-ProverArXiv, abs/1105.5465
U. Egly, Thomas Eiter, H. Tompits, S. Woltran (2000)
Solving Advanced Reasoning Tasks Using Quantified Boolean Formulas
Hubert Comon-Lundh, P. Lescanne (1989)
Equational Problems and DisunificationJ. Symb. Comput., 7
(1970)
On the Complexity of Proofs in Propositi onal Logics’.Seminars
E. Giunchiglia, Massimo Narizzano, A. Tacchella (2001)
QUBE: A System for Deciding Quantified Boolean Formulas Satisfiability
A. Colmerauer (1984)
Equations and Inequations on Finite and Infinite Trees
J. Siekmann, G. Wrightson (2012)
Automation of reasoning--classical papers on computational logic
H. Büning, Marek Karpinski, Andreas Flögel (1995)
Resolution for Quantified Boolean FormulasInf. Comput., 117
R. Caferra, N. Zabel (1990)
Extending Resolution for Model Construction
J. Lassez, Michael Maher, K. Marriott (1986)
Unification Revisited
D. Kapur, P. Narendran, D. Rosenkrantz, Hantao Zhang (1991)
Sufficient-completeness, ground-reducibility and their complexityActa Informatica, 28
U. Egly, H. Tompits, S. Woltran (2004)
On Quantifier Shifting for Quantified Boolean Formulas
G. Kuper, K. McAloon, K. Palem, K. Perry (1988)
Efficient parallel algorithms for anti-unification and relative complement[1988] Proceedings. Third Annual Information Symposium on Logic in Computer Science
J. Siekmann (1986)
Unification theoryDecis. Support Syst., 6
(1970)
On the Complexity of Proofs in Propositional Logics'. Seminars in Mathematics 8
G. Gottlob, R. Pichler (2001)
Working with ARMs: Complexity results on atomic representations of Herbrand modelsInformation and Computation, 165
J. Rintanen (1999)
Improvements to the Evaluation of Quantified Boolean Formulae
K. Kunen (1987)
Answer Sets and Negation-as-Failure
G. Gottlob, R. Pichler (2001)
Working with ARMsInformation & Computation, 165
R. Letz (2002)
Lemma and Model Caching in Decision Procedures for Quantified Boolean Formulas
Marco Cadoli, A. Giovanardi, M. Schaerf (1998)
An Algorithm to Evaluate Quantified Boolean Formulae
David Johnson (1982)
The NP-Completeness Column: An Ongoing GuideJ. Algorithms, 4
D. Pearce, H. Tompits, S. Woltran (2001)
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions
L. Stockmeyer (1976)
The Polynomial-Time HierarchyTheor. Comput. Sci., 3
G. Gottlob, Sherry Marcus, A. Nerode, G. Salzer, V. Subrahmanian (1996)
A Non-Ground Realization of the Stable and Well-Founded SemanticsTheor. Comput. Sci., 166
J. Lassez, Michael Maher, K. Marriott (1991)
Elimination of Negation in Term Algebras
R. Pichler (1998)
Completeness and Redundancy in Constrained Clause Logic
E. Goldberg, Y. Novikov (2002)
BerkMin: A fast and robust SAT-solverProceedings 2002 Design, Automation and Test in Europe Conference and Exhibition
J. Lassez, K. Marriott (1986)
Explicit representation of terms defined by counter examplesJournal of Automated Reasoning, 3
M. Garey (1979)
Johnson: computers and intractability: a guide to the theory of np- completeness (freeman
Subsumption is an important redundancy elimination method in automated deduction. A clause D is subsumed by a set $$\mathcal{C}$$ of clauses if there is a clause C ∈ $$\mathcal{C}$$ and a substitution σ such that the literals of Cσ are included in D. In the field of automated model building, subsumption has been modified to an even stronger redundancy elimination method, namely the so-called clausal H-subsumption. Atomic H-subsumption emerges from clausal H-subsumption by restricting D to an atom and $$\mathcal{C}$$ to a set of atoms. Both clausal and atomic H-subsumption play an indispensable key role in automated model building. Moreover, problems equivalent to atomic H-subsumption have been studied with different terminologies in many areas of computer science. Both clausal and atomic H-subsumption are known to be intractable, i.e., Π p 2 -complete and NP-complete, respectively. In this paper, we present a new approach to deciding (clausal and atomic) H-subsumption that is based on a reduction to QSAT2 and SAT, respectively.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Dec 31, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.