A graph-theoretic approach to default logic

DOI10.1006/inco.1994.1058zbMath0820.68112OpenAlexW1972369425WikidataQ62039898 ScholiaQ62039898MaRDI QIDQ1333271

Yannis Dimopoulos, Vangelis F. Magirou

Publication date: 13 September 1994

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.1994.1058

zbMATH Keywords

default logicgraph-theoretic representation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Logic in artificial intelligence (68T27)

Related Items

Operational concepts of nonmonotonic logics. I: Default logic ⋮ Default theories that always have extensions ⋮ Fixed-parameter tractability of disjunction-free default reasoning ⋮ Finding kernels or solving SAT ⋮ Kernels in digraphs that are not kernel perfect ⋮ Propositional discourse logic ⋮ Graph theoretical structures in logic programs and default theories ⋮ Alternative foundations for Reiter's default logic