In this paper we study the properties of the class of head-cycle-free extended disjunctive logic programs (HEDLPs), which includes, as a special case, all nondisjunctive extended logic programs.Expand

We present a mapping from a class of default theories to sentences in propositional logic, such that each model of the latter corresponds to an extension of the former.Expand

This paper addresses the problem of computing the minimal models of a given CNF propositional theory when the theory can be represented as an acyclic network of low-arity relations.Expand

In this paper we show how propositional default theories can be characterized by classical propositional theories such that there is a one-to-one correspondence between models for the latter and extensions of the former.Expand

We present a semantic framework in which many of the known default proof systems can be naturally characterized, and prove soundness and completeness theorems for several such proof systems.Expand

Proceedings Ninth Annual IEEE Symposium on Logicâ€¦

4 July 1994

TLDR

We present a semantic framework in which many of the known default proof systems can be naturally characterized, and prove soundness and completeness theorems for several such proof systems.Expand

We identify several new tractable subsets and several new intractable simple cases for reasoning in the propositional version of Reiter's default logic.Expand

This paper provides new algorithms for performing minimal model finding and checking over positive propositional CNFs and model minimization over propositionalCNFs.Expand

We present a generalization of the temporal propositional logic of linear time which is useful for stating and proving properties of the generic execution sequence of a parallel program or a non-deterministic program.Expand