A system for computing constrained default logic extensions
From MaRDI portal
Publication:5236437
DOI10.1007/3-540-61630-6_16zbMATH Open1427.68286OpenAlexW1642770377MaRDI QIDQ5236437FDOQ5236437
Authors:
Publication date: 8 October 2019
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61630-6_16
Recommendations
- A correct logic programming computation of default logic extensions
- scientific article; zbMATH DE number 516983
- Computing constrained default extensions -- a constraint satisfaction problem
- scientific article; zbMATH DE number 5198932
- scientific article; zbMATH DE number 2079775
- scientific article; zbMATH DE number 124281
- scientific article; zbMATH DE number 1292298
- Default consequence relations as a logical framework for logic programs
- A Default Approach to Semantics of Logic Programs with Constraint Atoms
- On the complexity of extension checking in default logic
Cites Work
- A logic for default reasoning
- A logical framework for default reasoning
- Alternative approaches to default logic
- Directly Sceptical Inheritance Cannot Capture the Intersection of Extensions
- Tableau-based characterization and theorem proving for default logic
- Cumulative default logic: In defense of nonmonotonic inference rules
- Title not available (Why is that?)
- A new methodology for query answering in default logics via structure-oriented theorem proving
- Computing with default logic
- Skeptical rational extensions
Cited In (3)
This page was built for publication: A system for computing constrained default logic extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5236437)
