A Graph Theoretic Approach to Default Logic

Dimopoulos, Yannis; Magirou, Vangelis

doi:10.1006/inco.1994.1058

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Journal Article

A Graph Theoretic Approach to Default Logic

MPS-Authors

/persons/resource/persons44325

Dimopoulos, Yannis
Programming Logics, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

1-s2.0-S0890540184710583-main.pdf
(Publisher version), 690KB

Supplementary Material (public)

There is no public supplementary material available

Citation

Dimopoulos, Y., & Magirou, V. (1994). A Graph Theoretic Approach to Default Logic. Information and Computation, 112(2), 239-256. doi:10.1006/inco.1994.1058.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0014-AD53-0

Abstract

A network representation of propositional seminormal disjunction-free default theories is presented, leading to a graph-theoretic approach to their analysis. The problem of finding an extension is proved to be equivalent to that of determining a kernel for a corresponding graph, allowing stronger complexity results as well as new conditions for the existence of extensions.