Bounded treewidth as a key to tractability of knowledge representation and reasoning
Reads0
Chats0
TLDR
In this article, the notion of treewidth has been applied to logic-based reasoning problems such as abduction, closed world reasoning, circumscription, and disjunctive logic programming.About:
This article is published in Artificial Intelligence.The article was published on 2010-01-01 and is currently open access. It has received 101 citations till now. The article focuses on the topics: Datalog & Circumscription.read more
Citations
More filters
Journal ArticleDOI
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems
Georg Gottlob,Stefan Szeider +1 more
TL;DR: In this paper, a survey of parameterized complexity of problems arising in artificial intelligence, database theory and automated reasoning is presented, in particular the constraint satisfaction problem, the evaluation problem of Boolean conjunctive database queries and the propositional satisfiability problem.
Proceedings ArticleDOI
Generalized hypertree decompositions: np-hardness and tractable variants
TL;DR: It is proven that determining whether a hypergraph H admits a tree projection with respect to ahypergraph G is NP-complete, and the new Component Hypertree Decomposition method is defined, which is tractable and strictly more general than other approximations to GHD published so far.
Journal ArticleDOI
Practical algorithms for MSO model-checking on tree-decomposable graphs
TL;DR: In this survey, practical algorithms for graph-theoretic problems that are expressible in monadic second-order logic are reviewed and the reader is introduced to the notions of tree-decompositions and the basics of monadicsecond order logic.
Proceedings Article
Backdoor trees
Marko Samer,Stefan Szeider +1 more
TL;DR: In this article, the authors introduce the notion of backdoor trees as an indicator for the presence of a hidden structure in real-world SAT instances and compare the size of backdoor sets with the number of backdoor variables.
Treewidth and Hypertree Width.
TL;DR: It turns out that many NP-hard problems can be solved efficiently over classes of instances of bounded treewidth or hypertree width: deciding whether a solution exists, computing a solution, and even computing an optimal solution are all polynomial-time tasks.
References
More filters
Book
Foundations of databases
TL;DR: This book discusses Languages, Computability, and Complexity, and the Relational Model, which aims to clarify the role of Semantic Data Models in the development of Query Language Design.
Book
Parameterized Complexity
TL;DR: An approach to complexity theory which offers a means of analysing algorithms in terms of their tractability, and introduces readers to new classes of algorithms which may be analysed more precisely than was the case until now.
Proceedings Article
The stable model semantics for logic programming
TL;DR: This paper introduces a succinct abstract representation of constraint atoms in which a constraint atom is represented compactly and shows that this representation provides a means to characterize dependencies of atoms in a program with constraint atoms, so that some standard characterizations and properties relying on these dependencies in the past for logic programs with ordinary atoms can be extended.
Journal ArticleDOI
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
TL;DR: Every minor-closed class of graphs that does not contain all planar graphs has a linear-time recognition algorithm that determines whether the treewidth of G is at most at most some constant $k$ and finds a tree-decomposition of G withtreewidth at most k.
Book ChapterDOI
Languages, automata, and logic
TL;DR: The subject of this chapter is the study of formal languages (mostly languages recognizable by finite automata) in the framework of mathematical logic.