A graph-theoretic approach to default logic

DOI10.1006/INCO.1994.1058zbMATH Open0820.68112OpenAlexW1972369425WikidataQ62039898 ScholiaQ62039898MaRDI QIDQ1333271FDOQ1333271

Authors: 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

Recommendations

• Graph theoretical structures in logic programs and default theories
• On kernels, defaults and even graphs
• scientific article; zbMATH DE number 408781
• scientific article; zbMATH DE number 5198305

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)

Cited In (10)

• Finding kernels or solving SAT
• Kernels in digraphs that are not kernel perfect
• Operational concepts of nonmonotonic logics. I: Default logic
• Alternative foundations for Reiter's default logic
• Title not available (Why is that?)
• Default theories that always have extensions
• Graph theoretical structures in logic programs and default theories
• Propositional discourse logic
• Extensions in graph normal form
• Fixed-parameter tractability of disjunction-free default reasoning

This page was built for publication: A graph-theoretic approach to default logic

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