Alternation and the computational complexity of logic programs
Journal of Logic Programming
On the sequential nature of unification
Journal of Logic Programming
Relational queries computable in polynomial time
Information and Control
A note on succinct representations of graphs
Information and Control
NP-completeness of the set unification and matching problems
Proc. of the 8th international conference on Automated deduction
Languages that capture complexity classes
SIAM Journal on Computing
Skolem normal forms concerning the least fixpoint
Computation theory and logic
Complexity of matching problems
Journal of Symbolic Computation
Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
Solving systems of polynomial inequalities in subexponential time
Journal of Symbolic Computation
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Some algebraic and geometric computations in PSPACE
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Parallel algorithms for term matching
SIAM Journal on Computing
Extending SLD resolution to equational horn clauses using E-unification
Journal of Logic Programming
Descriptive characterizations of computational complexity
Journal of Computer and System Sciences
Quantifier elimination in the theory of an algebraically-closed field
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The alternating fixpoint of logic programs with negation
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Declarative modeling of the operational behavior of logic languages
Theoretical Computer Science
Foundations of Equational Logic Programming
Foundations of Equational Logic Programming
Generalized closed world assumption is II-complete
Information Processing Letters
Logic programming and databases
Logic programming and databases
The expressive power of stratified logic programs
Information and Computation
Hypothetical datalog: complexity and expressibility
Theoretical Computer Science
Datalog extensions for database queries and updates
Journal of Computer and System Sciences
Journal of Computer and System Sciences
Handbook of theoretical computer science (vol. B)
Journal of the ACM (JACM)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Computational complexity and constraint logic programming languages
Proceedings of the 1990 North American conference on Logic programming
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
Capturing complexity classes by fragments of second-order logic
Theoretical Computer Science - Special issue on logic and applications to computer science
Testing logic programs for local stratification
Theoretical Computer Science
On the complexity of propositional knowledge base revision, updates, and counterfactuals
Artificial Intelligence
Propositional circumscription and extended closed-world reasoning are &Pgr;p2-complete
Theoretical Computer Science
On computational complexity of Prolog programs
Informatika '91 Selected papers of the 5th Soviet-French symposium on Theoretical computer science, methods and tools for compilation, and program development
Hereditarily-finite sets, data bases and polynomial-time computability
Informatika '91 Selected papers of the 5th Soviet-French symposium on Theoretical computer science, methods and tools for compilation, and program development
Decision procedure for constraint based extensions of Datalog
Constraint logic programming
The complexity of algorithmic problems on succinct instances
Computer science
Complexity of unification problems with associative-commutative operators
Journal of Automated Reasoning
Adding disjunction to datalog (extended abstract)
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Handbook of logic in artificial intelligence and logic programming
The complexity of logic-based abduction
Journal of the ACM (JACM)
Computing with first-order logic
Selected papers of the 23rd annual ACM symposium on Theory of computing
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The expressive powers of the logic programming semantics
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity of Makanin's algorithm
Journal of the ACM (JACM)
Relational expressive power of constraint query languages
PODS '96 Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Reducing disjunctive to non-disjunctive semantics by shift-operations
Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
&Dgr;-languages for sets and LOGSPACE computable graph transformers
NSL '94 Proceedings of the first workshop on Non-standard logics and logical aspects of computer science
The expressive powers of stable models for bound and unbound DATALOG queries
Journal of Computer and System Sciences - special issue on complexity theory
The resolution calculus
ACM Transactions on Database Systems (TODS)
Abduction from logic program: semantics and complexity
Theoretical Computer Science
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
The Semantics of Predicate Logic as a Programming Language
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Contributions to the Theory of Logic Programming
Journal of the ACM (JACM)
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Principles of Database and Knowledge-Base Systems: Volume II: The New Technologies
Computability Theory, Semantics, and Logic Programming
Computability Theory, Semantics, and Logic Programming
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
The power of languages for the manipulation of complex values
The VLDB Journal — The International Journal on Very Large Data Bases
A Possible World Semantics for Disjunctive Databases
IEEE Transactions on Knowledge and Data Engineering
Delta-Languages for Sets and sub-PTIME Graphs Transformers
ICDT '95 Proceedings of the 5th International Conference on Database Theory
Deterministic and Non-Deterministic Stable Model Semantics for Unbound DATALOG Queries
ICDT '95 Proceedings of the 5th International Conference on Database Theory
Total and Partial Well-Founded Datalog Coincide
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Complexity of Query Answering in Logic Databases with Complex Values
LFCS '97 Proceedings of the 4th International Symposium on Logical Foundations of Computer Science
Second Order Logic and the Weak Exponential Hierarchies
MFCS '95 Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science
The Expressive Power of Unique Total Stable Model Semantics
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Complexity Results for Abductive Logic Programming
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Computing Well-founded Semantics Faster
LPNMR '95 Proceedings of the Third International Conference on Logic Programming and Nonmonotonic Reasoning
Modular Logic Programming and Generalized Quantifiers
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
The Expressive Power of Partial Models in Disjunctive Deductive Databases
LID '96 Proceedings of the International Workshop on Logic in Databases
On Indefinite Databases and the Closed World Assumption
Proceedings of the 6th Conference on Automated Deduction
Some Results on Equational Unification
Proceedings of the 10th International Conference on Automated Deduction
Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Succinct Representation, Leaf Languages, and Projection Reductions
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The application of theorem proving to question-answering systems
The application of theorem proving to question-answering systems
A faster PSPACE algorithm for deciding the existential theory of the reals
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Complexity of nonrecursive logic programs with complex values
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Verification of relational tranducers for electronic commerce
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Probabilistic logic programming with conditional constraints
ACM Transactions on Computational Logic (TOCL)
Complexity and expressive power of logic programming
ACM Computing Surveys (CSUR)
Introduction to logic-based artificial intelligence
Logic-based artificial intelligence
Reasoning agents in dynamic domains
Logic-based artificial intelligence
Propositional default logics made easier: computational complexity of model checking
Theoretical Computer Science
On the Complexity of Single-Rule Datalog Queries
LPAR '99 Proceedings of the 6th International Conference on Logic Programming and Automated Reasoning
Reasoning about Evolving Nonmonotonic Knowledge Bases
LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
Disjunctive Logic Programming: A Survey and Assessment
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Omega-Restricted Logic Programs
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Generalized Quantifiers in Logic Programs
ESSLLI '97 Revised Lectures from the 9th European Summer School on Logic, Language, and Information: Generalized Quantifiers and Computation
On Complexity of Updates through Integrity Constraints
CL '00 Proceedings of the First International Conference on Computational Logic
On properties of update sequences based on causal rejection
Theory and Practice of Logic Programming
Multiset rewriting and the complexity of bounded security protocols
Journal of Computer Security
Type inference for datalog and its application to query optimisation
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Towards a System for Ontology-Based Information Extraction from PDF Documents
OTM '08 Proceedings of the OTM 2008 Confederated International Conferences, CoopIS, DOA, GADA, IS, and ODBASE 2008. Part II on On the Move to Meaningful Internet Systems
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Decidable Order-Sorted Logic Programming for Ontologies and Rules with Argument Restructuring
ISWC '09 Proceedings of the 8th International Semantic Web Conference
SecPAL: Design and semantics of a decentralized authorization language
Journal of Computer Security - Digital Identity Management (DIM 2007)
Analyzing the AIR language: a semantic web (production) rule language
RR'10 Proceedings of the Fourth international conference on Web reasoning and rule systems
Logic programming and uncertainty
SUM'11 Proceedings of the 5th international conference on Scalable uncertainty management
Relaxed safeness in Datalog-based policies
RuleML'11 Proceedings of the 5th international conference on Rule-based modeling and computing on the semantic web
Foundations of rule-based query answering
RW'07 Proceedings of the Third international summer school conference on Reasoning Web
Hi-index | 0.00 |
This paper surveys various complexity results on different forms of logic programming. The main focus is on decidable forms of logic programming, in particular, propositional logic programming and datalog, but we also mention general logic programming with function symbols. Next to classical results on plain logic programming (pure Horn clause programs), more recent results on various important extensions of logic programming are surveyed. These include logic programming with different forms of negation, disjunctive logic programming, logic programming with equality, and constraint logic programming. The complexity of the unification problem is also addressed.