Default theories that always have extensions

DOI10.1016/0004-3702(94)90087-6zbMATH Open0938.68837OpenAlexW2165394462MaRDI QIDQ1337686FDOQ1337686

Authors: Christos Papadimitriou, Martha Sideri 

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

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27)

Cites Work

• Title not available (Why is that?)
• A logic for default reasoning
• On kernels, defaults and even graphs
• A graph-theoretic approach to default logic
• Hard problems for simple default logics
• Horn clause queries and generalizations
• General logical databases and programs: Default logic semantics and stratification
• Formalizing nonmonotonic reasoning systems

Cited In (4)

• Defeasible inheritance on cyclic networks
• Restricted semantics for default reasoning
• Alternative foundations for Reiter's default logic
• Expressing preferences in default logic

This page was built for publication: Default theories that always have extensions

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