Journal ArticleDOI
Removing redundancy from a clause
Reads0
Chats0
TLDR
It is proved that testing whether a given clause is condensed is co-NP-complete and show that several problems related to clause condensing belong to complexity classes that are, probably, slightly harder than NP.About:
This article is published in Artificial Intelligence.The article was published on 1993-06-01. It has received 75 citations till now. The article focuses on the topics: Redundancy (engineering) & Undecidable problem.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.
Journal ArticleDOI
Data exchange: getting to the core
TL;DR: The core of a structure is the smallest substructure that is also a homomorphic image of the structure, and hence the smallest universal solution, which makes the core an ideal solution for data exchange.
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.
DissertationDOI
Reasoning in description logics using resolution and deductive databases
TL;DR: A novel algorithm that reduces a SHIQ(D) knowledge base KB to a disjunctive datalog program DD(KB) such that KB and DD( KB) entail the same set of ground facts, and shows a performance increase in query answering over existing DL systems of one or more orders of magnitude.
References
More filters
Book
Symbolic Logic and Mechanical Theorem Proving
TL;DR: This book contains an introduction to symbolic logic and a thorough discussion of mechanical theorem proving its applications and how it can be applied to various areas such as question answering, problem solving, program analysis, and program synthesis.
Journal ArticleDOI
What you always wanted to know about Datalog (and never dared to ask)
TL;DR: The syntax and semantics of Datalog and its use for querying a relational database are presented, and the most relevant methods for achieving efficient evaluations of Daloog queries are presented.
Book ChapterDOI
A catalog of complexity classes
TL;DR: This chapter discusses the concepts needed for defining the complexity classes, a set of problems of related resource-based complexity that can be solved by an abstract machine M using O(f(n) of resource R, where n is the size of the input.
Journal ArticleDOI
The complexity of optimization problems
TL;DR: It is shown that TRAVELING SALESPERSON and KNAPSACK are complete for OptP, and that CLIQUE and COLORING arecomplete for a subclass of OptP .