General domain circumscription and its first-order reduction

DOI10.1007/3-540-61313-7_65zbMath1419.68109OpenAlexW1694340589MaRDI QIDQ4632291

Patrick Doherty, Andrzej Szałas, Witold Łukaszewicz

Publication date: 29 April 2019

Published in: Practical Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61313-7_65

zbMATH Keywords

universal theoryexistential quantifierpredicate variablepredicate symbolfunction symbol

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Related Items (1)

General domain circumscription and its first-order reduction

Uses Software

• MiniTab

Cites Work

• Unnamed Item
• Unnamed Item
• The mathematics of non-monotonic reasoning
• First-order syntactic characterizations of minimal entailment, domain- minimal entailment, and Herbrand entailment
• A tableau prover for domain minimization
• Computing circumscription revisited: A reduction algorithm
• Untersuchungen über das Eliminationsproblem der mathematischen Logik
• On the Correspondence Between Modal and Classical Logic: an Automated Approach
• General domain circumscription and its first-order reduction

This page was built for publication: General domain circumscription and its first-order reduction