Amanote Research
Register
Sign In
Complexity of Nonrecursive Logic Programs With Complex Values
doi 10.1145/275487.275515
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 1998
Authors
Sergei Vorobyov
Andrie Voronkov
Publisher
ACM Press
Related search
Logic Programs With Functions and Default Values
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Lower-Bound Time-Complexity Analysis of Logic Programs
Recursive Aggregates in Disjunctive Logic Programs: Semantics and Complexity
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
On the Equivalence of Recursive and Nonrecursive Datalog Programs
Logic Programs With Refutation Rules
Optimization of Logic Programs With Dynamic Scheduling
Termination of Logic Programs With Delay Declarations
The Journal of Logic Programming
The Difficulties of Learning Logic Programs With Cut
Journal of Artificial Intelligence Research
Artificial Intelligence
On the Semantics of Logic Programs With Preferences
Journal of Artificial Intelligence Research
Artificial Intelligence
