Hypothetical datalog: complexity and expressibility
TLDR
It is shown that augmenting Horn-clause logic with hypothetical addition increases its data-complexity from PTIME to PSPACE, and any typed generic query that is computable in PSPACE can be expressed as a stratified rulebase of hypothetical additions and deletions.About:
This article is published in Theoretical Computer Science.The article was published on 1990-10-01 and is currently open access. It has received 70 citations till now. The article focuses on the topics: EXPTIME & Datalog.read more
Citations
More filters
Journal ArticleDOI
Complexity and expressive power of logic programming
TL;DR: This article surveys various complexity and expressiveness results on different forms of logic programming, in particular, propositional logic programming and datalog, but it also mentions general logic programming with function symbols.
Proceedings ArticleDOI
Foundations of semantic web databases
TL;DR: This work proposes a query language with well-defined semantics and study the complexity of query processing, query containment, and simplification of answers, including computational aspects of testing entailment and redundancy.
Proceedings ArticleDOI
Complexity and expressive power of logic programming
TL;DR: The main focus is on decidable forms of logic programming, in particular propositional logic programming and datalog, but the also mention general logic programming with function symbols, and the complexity of the unification problem is addressed.
Journal ArticleDOI
On the Semantics of Arbitration
TL;DR: The operator of model-fitting is defined and analyzed in the paper and it is shown that arbitration operators can be also characterized as accomplishing a minimal change.
Journal ArticleDOI
An overview of transaction logic
Anthony J. Bonner,Michael Kifer +1 more
TL;DR: An overview of Transaction Logic is presented, designed to deal with the phenomenon of state changes in logic programming, databases, and AI, which appears to be suitable as a logical model of hitherto nonlogical phenomena.
References
More filters
Book
Introduction to Automata Theory, Languages, and Computation
TL;DR: This book is a rigorous exposition of formal languages and models of computation, with an introduction to computational complexity, appropriate for upper-level computer science undergraduates who are comfortable with mathematical arguments.
Journal ArticleDOI
The Semantics of Predicate Logic as a Programming Language
TL;DR: In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated, and it is concluded that operational semantics is a part ofProof theory and that fixpoint semantic is a special case of model-theoretic semantics.
Book
An Introduction to Automata Theory
TL;DR: Great Aunt Eugenia and other automata Sundry machines Implementing finite automata Implementation and realization Behavioural equivalence, SP partitions and reduced machines
Book
Logic for problem solving
Robert A. Kowalski,Steve Smoliar +1 more
TL;DR: This book investigates the application of logic to problem-solving and computer programming and assumes no previous knowledge of these fields, and may be Karl duncker in addition to make difficult fill one of productive.
Proceedings ArticleDOI
The complexity of relational query languages (Extended Abstract)
TL;DR: The pattern which will be shown is that the expression complexity of the investigated languages is one exponential higher then their data complexity, and for both types of complexity the authors show completeness in some complexity class.