Computing circumscription revisited: A reduction algorithm
From MaRDI portal
Publication:1367072
DOI10.1023/A:1005722130532zbMath0939.03033OpenAlexW1536469384MaRDI QIDQ1367072
Witold Łukaszewicz, Andrzej Szałas, Patrick Doherty
Publication date: 17 September 1997
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1005722130532
quantifier eliminationnonmonotonic reasoningreduction algorithmcircumscriptioncommon-sense reasoningfirst-order formulasmixed quantifierssecond-order formulas
Related Items
Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications, Reasoning under minimal upper bounds in propositional logic, Probabilistic Event Calculus for Event Recognition, Representing action: indeterminacy and ramifications, Dual forgetting operators in the context of weakest sufficient and strongest necessary conditions, The Ackermann approach for modal logic, correspondence theory and second-order reduction, Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA, Projection and scope-determined circumscription, Sahlqvist correspondence for modal mu-calculus, General domain circumscription and its first-order reduction, Loop formulas for circumscription, Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals, SCAN—Elimination of predicate quantifiers, First-Order Resolution Methods for Modal Logics, John McCarthy's legacy, Loop-separable programs and their first-order definability, Annotation theories over finite graphs, Elementary canonical formulae: extending Sahlqvist's theorem, Formalizing narratives using nested circumscription, Reasoning with different levels of uncertainty, Towards incorporating background theories into quantifier elimination, On the strength and scope of DLS, Second-order reasoning in description logics, Approximate databases: a support tool for approximate reasoning, Voting by eliminating quantifiers, Reasoning with infinite stable models
