The following pages link to Thomas Eiter (Q171927):
Displayed 50 items.
- Semi-equilibrium models for paracoherent answer set programs (Q253992) (← links)
- Domain expansion for ASP-programs with external sources (Q254002) (← links)
- Evaluating epistemic negation in answer set programming (Q286399) (← links)
- Data repair of inconsistent nonmonotonic description logic programs (Q322065) (← links)
- Conjunctive query answering in the description logic \(\mathcal S \mathcal H\) using knots (Q414848) (← links)
- Finding explanations of inconsistency in multi-context systems (Q460632) (← links)
- Updating action domain descriptions (Q622109) (← links)
- The complexity of nested counterfactuals and iterated knowledge base revisions (Q676453) (← links)
- A logic programming approach to knowledge-state planning. II: The DLV\(^\mathcal K\) system (Q814436) (← links)
- Complexity results for explanations in the structural-model approach (Q814579) (← links)
- Reasoning under minimal upper bounds in propositional logic (Q861253) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- Data complexity of query answering in expressive description logics via tableaux (Q945056) (← links)
- Undoing the effects of action sequences (Q946576) (← links)
- Exploiting conjunctive queries in description logic programs (Q1028641) (← links)
- An efficient method for eliminating varying predicates from a circumscription (Q1193478) (← links)
- On the complexity of propositional knowledge base revision, updates, and counterfactuals (Q1199919) (← links)
- Double Horn functions (Q1271644) (← links)
- Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
- Heterogeneous active agents, I: Semantics (Q1285674) (← links)
- Heterogeneous active agents, II: Algorithms and complexity (Q1285675) (← links)
- Preferred answer sets for extended logic programs (Q1292319) (← links)
- Exact transversal hypergraphs and application to Boolean \(\mu\)-functions (Q1333159) (← links)
- Querying disjunctive databases through nonmonotonic logics (Q1350535) (← links)
- On the partial semantics for disjunctive deductive databases (Q1370627) (← links)
- Abduction from logic programs: Semantics and complexity (Q1389684) (← links)
- Semantics and complexity of abduction from default theories (Q1402749) (← links)
- (Q1589636) (redirect page) (← links)
- Default reasoning from conditional knowledge bases: Complexity and tractable cases (Q1589638) (← links)
- Computing intersections of Horn theories for reasoning with models (Q1606297) (← links)
- Enhancing model checking in verification by AI techniques (Q1606310) (← links)
- LARS: a logic-based framework for analytic reasoning over streams (Q1648076) (← links)
- Enhancing context knowledge repositories with justifiable exceptions (Q1749389) (← links)
- Recognizing renamable generalized propositional Horn formulas is NP- complete (Q1804878) (← links)
- Complexity results for structure-based causality. (Q1852862) (← links)
- Recognition and dualization of disguised bidual Horn functions. (Q1853017) (← links)
- On the complexity of data disjunctions. (Q1853503) (← links)
- Generating Boolean \(\mu\)-expressions (Q1892713) (← links)
- Normal forms for second-order logic over finite structures, and classification of NP optimization problems (Q1919763) (← links)
- Distance measures for point sets and their computation (Q1920226) (← links)
- On the computational cost of disjunctive logic programming: Propositional case (Q1924780) (← links)
- Bidual Horn functions and extensions (Q1961447) (← links)
- Heterogeneous active agents. III: Polynomially implementable agents (Q1978315) (← links)
- Pruning external minimality checking for answer set programs using semantic dependencies (Q2046045) (← links)
- Reasoning with justifiable exceptions in \(\mathcal{EL}_\bot\) contextualized knowledge repositories (Q2185461) (← links)
- Answering regular path queries in expressive description logics via alternating tree-automata (Q2252521) (← links)
- Determining inference semantics for disjunctive logic programs (Q2289011) (← links)
- Pruning external minimality checking for ASP using semantic dependencies (Q2326745) (← links)
- A data model and algebra for probabilistic complex values (Q2349820) (← links)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)