General domain circumscription and its first-order reduction

DOI10.1007/3-540-61313-7_65zbMATH Open1419.68109OpenAlexW1694340589MaRDI QIDQ4632291FDOQ4632291

Authors: Patrick Doherty, Witold Łukaszewicz, Andrzej Szałas 

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

Recommendations

• scientific article; zbMATH DE number 1337728
• scientific article; zbMATH DE number 994057
• Computing circumscription revisited: A reduction algorithm
• Some computational aspects of circumscription
• scientific article; zbMATH DE number 67498

zbMATH Keywords

universal theoryexistential quantifierpredicate variablepredicate symbolfunction symbol

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites Work

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

Cited In (2)

• General domain circumscription and its first-order reduction
• Title not available (Why is that?)

Uses Software

• MiniTab

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

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