Projection and scope-determined circumscription

DOI10.1016/j.jsc.2011.12.034zbMath1259.03025OpenAlexW2074567616MaRDI QIDQ429594

Christoph Wernhard

Publication date: 20 June 2012

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2011.12.034

zbMATH Keywords

first-order logicforgettingcircumscriptionsecond-order quantifier eliminationliteral projectionraisingstrongest necessary and weakest sufficient condition

Mathematics Subject Classification ID

Related Items (1)

Semantic forgetting in expressive description logics

Uses Software

• ToyElim

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm to compute circumscription
• Circumscription - a form of non-monotonic reasoning
• Computing circumscription revisited: A reduction algorithm
• CIRCUMSCRIPTION AND PROJECTION AS PRIMITIVES OF LOGIC PROGRAMMING
• Literal Projection for First-Order Logic
• Tableaux for Projection Computation and Knowledge Compilation
• Clause Elimination Procedures for CNF Formulas
• Logics in Artificial Intelligence
• On strongest necessary and weakest sufficient conditions

This page was built for publication: Projection and scope-determined circumscription