Thomas__Eiter
A framework for declarative update specifications in logic programs
Abduction from logic programs: Semantics and complexity
Complexity aspects of various semantics for disjunctive databases
Complexity results for disjunctive logic programming and application to nonmonotonic logics
Computing Non-Ground Representations of Stable Models
Disjunctive Datalog
Distance Measures for Point Sets and Their Computation
Expressive power and complexity of partial models for disjunctive deductive databases
Heterogeneous Active Agents, II: Algorithms and Complexity
Heterogeneous Active Agents, III: Polynomially implementable agents
Identifying the minimal transversals of a hypergraph and related problems
Mannila: Recognizing renamable generalized propositional Horn formulas is NP-complete
Modular logic programming and generalized quantifiers
Normal Forms for Second-Order Logic over Finite Structures
On properties of update sequences based on causal rejection. Theory and Practice of Logic Programming
On the complexity of propositional knowledge base revision, updates, and counterfactuals
On the Partial Semantics for Disjunctive Deductive Databases
Propositional Circumscription and Extended Closed World Reasoning are \Pi P 2 -complete
Semantics and complexity of abduction from default theories
The complexity of nested counterfactuals and iterated knowledge base revisions
The KR System dlv: Progress Report, Comparisons and Benchmarks