| Publication | Date of Publication | Type |
|---|
| Artificial intelligence and artificial ignorance (invited talk) | 2026-02-19 | Paper |
| The complexity of acyclic conjunctive queries | 2025-10-29 | Paper |
Fast parallel hypertree decompositions in logarithmic recursion depth
ACM Transactions on Database Systems | 2024-04-30 | Paper |
Incremental Updates of Generalized Hypertree Decompositions
ACM Journal of Experimental Algorithmics | 2024-04-14 | Paper |
Fractional covers of hypergraphs with bounded multi-intersection
Theoretical Computer Science | 2023-10-26 | Paper |
Polynomial combined first-order rewritings for linear and guarded existential rules
Artificial Intelligence | 2023-07-26 | Paper |
The HyperTrac project: recent progress and future research directions on hypergraph decompositions
(available as arXiv preprint) | 2022-12-21 | Paper |
The complexity class θp2: Recent results and applications in AI and modal logic
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Stable Model Semantics for Guarded Existential Rules and Description Logics: Decidability and Complexity
Journal of the ACM | 2022-12-08 | Paper |
Complexity Analysis of Generalized and Fractional Hypertree Decompositions
Journal of the ACM | 2022-12-08 | Paper |
Semantic Optimization of Conjunctive Queries
Journal of the ACM | 2022-12-08 | Paper |
MV-Datalog+-: Effective Rule-based Reasoning with Uncertain Observations
Theory and Practice of Logic Programming | 2022-09-30 | Paper |
Fast and parallel decomposition of constraint satisfaction problems
Constraints | 2022-09-29 | Paper |
HyperBench. A benchmark and tool for hypergraphs and empirical findings
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
Complexity results for abductive logic programming
Logic Programming and Nonmonotonic Reasoning | 2022-08-30 | Paper |
Datalog: Bag Semantics via Set Semantics
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7559412 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
Guarded Ontology-Mediated Queries
Hajnal Andréka and István Németi on Unity of Science | 2021-12-10 | Paper |
Query Rewriting and Optimization for Ontological Databases
ACM Transactions on Database Systems | 2021-11-25 | Paper |
| Vadalog: recent advances and applications | 2020-02-18 | Paper |
Monadic Datalog, tree validity, and limited access containment
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
| Tractable reasoning in description logics with functionality constraints | 2018-10-18 | Paper |
The impact of active domain predicates on guarded existential rules
Fundamenta Informaticae | 2018-05-03 | Paper |
Achieving new upper bounds for the hypergraph duality problem through logic
SIAM Journal on Computing | 2018-04-26 | Paper |
Achieving new upper bounds for the hypergraph duality problem through logic
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
Tree projections and constraint optimization problems: fixed-parameter tractability and parallel algorithms
Journal of Computer and System Sciences | 2018-04-18 | Paper |
Corrigendum: ``Combining decidability paradigms for existential rules
Theory and Practice of Logic Programming | 2017-11-09 | Paper |
| The ICDT 2016 Test of Time Award announcement | 2017-07-14 | Paper |
The DLV system for knowledge representation and reasoning
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
Complexity of propositional nested circumscription and nested abnormality theories
ACM Transactions on Computational Logic | 2017-07-12 | Paper |
The impact of active domain predicates on guarded existential rules
Web Reasoning and Rule Systems | 2017-06-20 | Paper |
Datalog LITE
ACM Transactions on Computational Logic | 2017-06-13 | Paper |
Logic, languages, and rules for web data extraction and reasoning over data
Language and Automata Theory and Applications | 2017-06-01 | Paper |
Recent advances in Datalog\(^\pm \)
Reasoning Web. Web Logic Rules | 2017-03-30 | Paper |
Tractability frontiers of the partner units configuration problem
Journal of Computer and System Sciences | 2016-04-18 | Paper |
Generalized hypertree decompositions: NP-hardness and tractable variants
Journal of the ACM | 2015-11-11 | Paper |
The complexity of acyclic conjunctive queries
Journal of the ACM | 2015-10-30 | Paper |
LoCo—A Logic for Configuration Problems
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Monadic Datalog over finite structures of bounded treewidth
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Existential second-order logic over graphs: charting the tractability frontier
Journal of the ACM | 2015-08-01 | Paper |
Monadic Datalog and the expressive power of languages for web information extraction
Journal of the ACM | 2015-08-01 | Paper |
Query answering under probabilistic uncertainty in Datalog\(+/-\) ontologies
Annals of Mathematics and Artificial Intelligence | 2014-06-26 | Paper |
The price of query rewriting in ontology-based data access
Artificial Intelligence | 2014-06-10 | Paper |
Querying the Guarded Fragment
Logical Methods in Computer Science | 2014-05-22 | Paper |
A backtracking-based algorithm for hypertree decomposition
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Combining decidability paradigms for existential rules
Theory and Practice of Logic Programming | 2014-02-27 | Paper |
Size and treewidth bounds for conjunctive queries
Journal of the ACM | 2014-02-17 | Paper |
| Decomposing combinatorial auctions and set packing problems | 2014-02-17 | Paper |
Taming the infinite chase: query answering under expressive relational constraints
The Journal of Artificial Intelligence Research (JAIR) | 2013-10-29 | Paper |
On minimal constraint networks
Artificial Intelligence | 2013-08-23 | Paper |
Towards more expressive ontology languages: the query answering problem
Artificial Intelligence | 2013-08-23 | Paper |
Querying the guarded fragment with transitivity
Automata, Languages, and Programming | 2013-08-07 | Paper |
Ontology-based semantic search on the web and its combination with the power of inductive reasoning
Annals of Mathematics and Artificial Intelligence | 2013-01-04 | Paper |
Datalog and Its Extensions for Semantic Web Databases
Lecture Notes in Computer Science | 2012-11-08 | Paper |
On the complexity of ontological reasoning under disjunctive existential rules
Mathematical Foundations of Computer Science 2012 | 2012-09-25 | Paper |
On the interaction of existential rules and equality constraints in ontology querying
Correct Reasoning | 2012-07-23 | Paper |
Querying UML class diagrams
Foundations of Software Science and Computational Structures | 2012-06-22 | Paper |
| scientific article; zbMATH DE number 5999532 (Why is no real title available?) | 2012-01-23 | Paper |
Distributed XML design
Journal of Computer and System Sciences | 2012-01-11 | Paper |
| scientific article; zbMATH DE number 5953613 (Why is no real title available?) | 2011-10-05 | Paper |
Optimization Methods for the Partner Units Problem
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems | 2011-05-26 | Paper |
The Model Checking Problem for Prefix Classes of Second-Order Logic: A Survey
Fields of Logic and Computation | 2010-09-03 | Paper |
Balanced queries: divide and conquer
Mathematical Foundations of Computer Science 2010 | 2010-09-03 | Paper |
New results on monotone dualization and generating hypergraph transversals
Proceedings of the thiry-fourth annual ACM symposium on Theory of computing | 2010-08-05 | Paper |
| Hypertree-width and related hypergraph invariants | 2010-07-30 | Paper |
Schema mapping discovery from data instances
Journal of the ACM | 2010-07-14 | Paper |
Second order logic and the weak exponential hierarchies
Lecture Notes in Computer Science | 2010-06-17 | Paper |
A logical approach to multicut problems
Information Processing Letters | 2010-03-24 | Paper |
Bounded treewidth as a key to tractability of knowledge representation and reasoning
Artificial Intelligence | 2010-03-16 | Paper |
Tree projections: Game characterization and computational aspects
Graph Theory, Computational Intelligence and Thought | 2010-01-07 | Paper |
Hyperconsistency width for constraint satisfaction: Algorithms and complexity results
Graph Theory, Computational Intelligence and Thought | 2010-01-07 | Paper |
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
Automata, Languages and Programming | 2009-07-14 | Paper |
Foundations of Information and Knowledge Systems
Lecture Notes in Computer Science | 2009-05-14 | Paper |
Foundations of Rule-Based Query Answering
Reasoning Web | 2009-02-17 | Paper |
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints | 2009-01-22 | Paper |
The complexity of XPath query evaluation and XML typing
Journal of the ACM | 2008-12-21 | Paper |
Conjunctive queries over trees
Journal of the ACM | 2008-12-21 | Paper |
Efficient core computation in data exchange
Journal of the ACM | 2008-12-21 | Paper |
Query Answering in the Description Logic Horn- $\mathcal{SHIQ}$
Logics in Artificial Intelligence | 2008-10-27 | Paper |
Computational aspects of monotone dualization: a brief survey
Discrete Applied Mathematics | 2008-09-10 | Paper |
Hypertree width and related hypergraph invariants
European Journal of Combinatorics | 2007-11-21 | Paper |
Automated Reasoning
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Second-Order Logic over Finite Structures – Report on a Research Programme
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Reasoning under minimal upper bounds in propositional logic
Theoretical Computer Science | 2007-01-09 | Paper |
SOFSEM 2006: Theory and Practice of Computer Science
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Graph-Theoretic Concepts in Computer Science
Lecture Notes in Computer Science | 2006-11-01 | Paper |
scientific article; zbMATH DE number 2243403 (Why is no real title available?)
(available as arXiv preprint) | 2006-01-04 | Paper |
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2087211 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2036324 (Why is no real title available?) | 2004-02-02 | Paper |
Semantics and complexity of abduction from default theories
Artificial Intelligence | 2003-08-28 | Paper |
On the complexity of single-rule datalog queries.
Information and Computation | 2003-08-19 | Paper |
Robbers, marshals, and guards: Game theoretic and logical characterizations of hypertree width.
Journal of Computer and System Sciences | 2003-08-19 | Paper |
Existential second-order logic over strings
Journal of the ACM | 2003-06-25 | Paper |
| scientific article; zbMATH DE number 1931696 (Why is no real title available?) | 2003-06-20 | Paper |
| scientific article; zbMATH DE number 1931693 (Why is no real title available?) | 2003-06-20 | Paper |
New Results on Monotone Dualization and Generating Hypergraph Transversals
SIAM Journal on Computing | 2003-06-19 | Paper |
| scientific article; zbMATH DE number 1926619 (Why is no real title available?) | 2003-06-11 | Paper |
| scientific article; zbMATH DE number 1884381 (Why is no real title available?) | 2003-03-18 | Paper |
Propositional default logics made easier: computational complexity of model checking.
Theoretical Computer Science | 2003-01-21 | Paper |
Working with ARMs: Complexity results on atomic representations of Herbrand models
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1834638 (Why is no real title available?) | 2002-11-25 | Paper |
Hypertree decompositions and tractable queries
Journal of Computer and System Sciences | 2002-09-12 | Paper |
Enhancing model checking in verification by AI techniques
Artificial Intelligence | 2002-07-24 | Paper |
| scientific article; zbMATH DE number 1696754 (Why is no real title available?) | 2002-07-22 | Paper |
Fixed-parameter complexity in AI and nonmonotonic reasoning
Artificial Intelligence | 2002-07-15 | Paper |
| scientific article; zbMATH DE number 1761406 (Why is no real title available?) | 2002-06-30 | Paper |
| scientific article; zbMATH DE number 1756016 (Why is no real title available?) | 2002-06-16 | Paper |
Computing LOGCFL certificates
Theoretical Computer Science | 2002-03-03 | Paper |
| Remarks on a Carnapian extension of S5 | 2001-12-18 | Paper |
On ACTL formulas having linear counterexamples
Journal of Computer and System Sciences | 2001-09-09 | Paper |
| Linear time Datalog and branching time logic | 2001-08-30 | Paper |
Complexity results for some eigenvector problems
International Journal of Computer Mathematics | 2001-08-21 | Paper |
A comparison of structural CSP decomposition methods
Artificial Intelligence | 2000-12-12 | Paper |
| scientific article; zbMATH DE number 1405452 (Why is no real title available?) | 2000-09-26 | Paper |
| scientific article; zbMATH DE number 1453052 (Why is no real title available?) | 2000-07-24 | Paper |
| scientific article; zbMATH DE number 1405655 (Why is no real title available?) | 2000-07-10 | Paper |
| scientific article; zbMATH DE number 1453079 (Why is no real title available?) | 2000-05-25 | Paper |
| scientific article; zbMATH DE number 1392308 (Why is no real title available?) | 2000-01-25 | Paper |
| scientific article; zbMATH DE number 1303429 (Why is no real title available?) | 1999-10-18 | Paper |
Succinctness as a source of complexity in logical formalisms
Annals of Pure and Applied Logic | 1999-09-22 | Paper |
On the expressiveness of frame satisfiability and fragments of second-order logic
Journal of Symbolic Logic | 1999-01-19 | Paper |
Expressiveness of stable model semantics for disjunctive logic programs with functions
The Journal of Logic Programming | 1998-07-16 | Paper |
Abduction from logic programs: Semantics and complexity
Theoretical Computer Science | 1998-06-30 | Paper |
On the indiscernibility of individuals in logic programming
Journal Of Logic And Computation | 1998-04-22 | Paper |
| scientific article; zbMATH DE number 1136651 (Why is no real title available?) | 1998-04-01 | Paper |
Capturing Relativized Complexity Classes without Order
Mathematical Logic Quarterly | 1998-03-30 | Paper |
The complexity of logic-based abduction
Journal of the ACM | 1998-02-02 | Paper |
NP trees and Carnap's modal logic
Journal of the ACM | 1998-02-02 | Paper |
Translating default logic into standard autoepistemic logic
Journal of the ACM | 1998-01-28 | Paper |
Relativized logspace and generalized quantifiers over finite ordered structures
Journal of Symbolic Logic | 1997-09-28 | Paper |
The complexity of nested counterfactuals and iterated knowledge base revisions
Journal of Computer and System Sciences | 1997-08-20 | Paper |
| scientific article; zbMATH DE number 978242 (Why is no real title available?) | 1997-06-03 | Paper |
| scientific article; zbMATH DE number 978240 (Why is no real title available?) | 1997-06-03 | Paper |
On the computational cost of disjunctive logic programming: Propositional case
Annals of Mathematics and Artificial Intelligence | 1997-03-25 | Paper |
A non-ground realization of the stable and well-founded semantics
Theoretical Computer Science | 1997-02-27 | Paper |
Datalog: A self-contained tutorial. II
Programming and Computer Software | 1997-01-14 | Paper |
Formalizing the repair process --- extended report
Annals of Mathematics and Artificial Intelligence | 1996-12-03 | Paper |
Identifying the Minimal Transversals of a Hypergraph and Related Problems
SIAM Journal on Computing | 1996-07-28 | Paper |
Normal forms for second-order logic over finite structures, and classification of NP optimization problems
Annals of Pure and Applied Logic | 1996-07-24 | Paper |
The complexity of default reasoning under the stationary fixed point semantics
Information and Computation | 1996-02-20 | Paper |
| scientific article; zbMATH DE number 512816 (Why is no real title available?) | 1994-11-13 | Paper |
Cumulative default logic: Finite characterization, algorithms, and complexity
Artificial Intelligence | 1994-11-08 | Paper |
Removing redundancy from a clause
Artificial Intelligence | 1993-10-31 | Paper |
Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete
Theoretical Computer Science | 1993-09-19 | Paper |
Selective inheritance of attribute values in relational databases
Discrete Applied Mathematics | 1993-01-31 | Paper |
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence | 1993-01-17 | Paper |
| scientific article; zbMATH DE number 97788 (Why is no real title available?) | 1993-01-17 | Paper |
Complexity Results for Nonmonotonic Logics
Journal Of Logic And Computation | 1993-01-16 | Paper |
An efficient method for eliminating varying predicates from a circumscription
Artificial Intelligence | 1992-09-27 | Paper |
| scientific article; zbMATH DE number 4201601 (Why is no real title available?) | 1990-01-01 | Paper |
Generating efficient diagnostic procedures from model-based knowledge using logic programming techniques
Computers & Mathematics with Applications | 1990-01-01 | Paper |
Magic semi-joins
Information Processing Letters | 1989-01-01 | Paper |
Properties and update semantics of consistent views
ACM Transactions on Database Systems | 1988-01-01 | Paper |
On the size of nonredundant FD-covers
Information Processing Letters | 1987-01-01 | Paper |
Subsumption and implication
Information Processing Letters | 1987-01-01 | Paper |
Taxonomy and formal properties of distributed joins
Information Systems | 1986-01-01 | Paper |
On the efficiency of subsumption algorithms
Journal of the ACM | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3945370 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3870581 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3744493 (Why is no real title available?) | 1981-01-01 | Paper |
