Computing circumscription revisited: A reduction algorithm

DOI10.1023/A:1005722130532zbMATH Open0939.03033OpenAlexW1536469384MaRDI QIDQ1367072FDOQ1367072

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

Recommendations

Some computational aspects of circumscription
An algorithm to compute circumscription
On the computability of circumscription
scientific article; zbMATH DE number 14664
On Reduct Construction Algorithms
On Reduct Construction Algorithms
scientific article
scientific article; zbMATH DE number 1251239
Algorithms and reductions for rewriting problems
On the computational complexity of cut-reduction

nonmonotonic reasoning reduction algorithm circumscription quantifier elimination common-sense reasoning first-order formulas mixed quantifiers second-order formulas

Mathematics Subject Classification ID

Other nonclassical logic (03B60) Logic in artificial intelligence (68T27)

Cited In (35)

Second-Order Quantifier Elimination on Relational Monadic Formulas – A Basic Method and Some Less Expected Applications
Towards incorporating background theories into quantifier elimination
John McCarthy's legacy
Reasoning with infinite stable models
Second-order reasoning in description logics
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
Sahlqvist correspondence for modal mu-calculus
Loop-separable programs and their first-order definability
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
General domain circumscription and its first-order reduction
Projection and scope-determined circumscription
Formalizing narratives using nested circumscription
Reasoning under minimal upper bounds in propositional logic
Representing action: indeterminacy and ramifications
First-Order Resolution Methods for Modal Logics
Some computational aspects of circumscription
A discussion and implementation of Brown's REX simplification algorithm
On Reduct Construction Algorithms
Annotation theories over finite graphs
Second-order quantifier elimination in higher-order contexts with applications to the semantical analysis of conditionals
Loop formulas for circumscription
Elementary canonical formulae: extending Sahlqvist's theorem
Voting by eliminating quantifiers
Polynomial-time checking of generalized Sahlqvist syntactic shape
On the strength and scope of DLS
A fixed-point theorem for Horn formula equations
Probabilistic Event Calculus for Event Recognition
Title not available (Why is that?)
An efficient method for eliminating varying predicates from a circumscription
A complete, nonredundant algorithm for reversed Skolemization
Approximate databases: a support tool for approximate reasoning
Reasoning with different levels of uncertainty
SCAN—Elimination of predicate quantifiers
Title not available (Why is that?)

This page was built for publication: Computing circumscription revisited: A reduction algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367072)