Default theories that always have extensions
From MaRDI portal
Publication:1337686
DOI10.1016/0004-3702(94)90087-6zbMath0938.68837OpenAlexW2165394462MaRDI QIDQ1337686
Martha Sideris, Christos H. Papadimitriou
Publication date: 26 February 1996
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(94)90087-6
Related Items (4)
Defeasible inheritance on cyclic networks ⋮ Restricted semantics for default reasoning ⋮ Expressing preferences in default logic ⋮ Alternative foundations for Reiter's default logic
Cites Work
- Unnamed Item
- Formalizing nonmonotonic reasoning systems
- A logic for default reasoning
- General logical databases and programs: Default logic semantics and stratification
- Hard problems for simple default logics
- A graph-theoretic approach to default logic
- On kernels, defaults and even graphs
- Horn clause queries and generalizations
This page was built for publication: Default theories that always have extensions
