• Publications
  • Influence
Propositional semantics for disjunctive logic programs
TLDR
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
  • 216
  • 35
Default Logic, Propositional Logic, and Constraints
TLDR
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
  • 39
  • 2
Markov Network Based Ontology Matching
TLDR
iMatch is a probabilistic scheme for ontology matching based on Markov networks, which has several advantages over other Probabilistic schemes. Expand
  • 60
  • 1
  • PDF
On computing minimal models
TLDR
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
  • 38
  • 1
Default Reasoning Using Classical Logic
TLDR
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
  • 35
  • 1
  • PDF
A modal logic for subjective default reasoning
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
  • 24
  • 1
  • PDF
A modal logic for subjective default reasoning
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
  • 15
  • 1
Yet some more complexity results for default logic
TLDR
We identify several new tractable subsets and several new intractable simple cases for reasoning in the propositional version of Reiter's default logic. Expand
  • 14
  • 1
  • PDF
On the tractability of minimal model computation for some CNF theories
TLDR
This paper provides new algorithms for performing minimal model finding and checking over positive propositional CNFs and model minimization over propositionalCNFs. Expand
  • 8
  • 1
  • PDF
A Temporal Logic for Proving Properties of Topologically General Executions
TLDR
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
  • 9
  • 1