Parallel evaluation of recursive rule queries
PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Decidability and expressiveness aspects of logic queries
PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Decidable optimization problems for database logic programs
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Expressiveness of restricted recursive queries
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A procedural semantics for well founded negation in logic programs
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the first-order expressibility of recursive queries
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Some computational aspects of circumscription
Journal of the ACM (JACM)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Progress measures and stack assertions for fair termination
PODC '92 Proceedings of the eleventh annual ACM symposium on Principles of distributed computing
On the equivalence of recursive and nonrecursive datalog programs
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The well-founded semantics of aggregation
PODS '92 Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Undecidable optimization problems for database logic programs
Journal of the ACM (JACM)
On the complexity of equivalence between recursive and nonrecursive Datalog programs
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Query evaluation in deductive databases with alternating fixpoint semantics
ACM Transactions on Database Systems (TODS)
Fixpoint logics, relational machines, and computational complexity
Journal of the ACM (JACM)
Languages for relational databases over interpreted structures
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Expressiveness of structured document query languages based on attribute grammars
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the expressive power of datalog: tools and a case study
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The expressive powers of the logic programming semantics (extended abstract)
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Logic programming revisited: logic programs as inductive definitions
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Expressiveness of structured document query languages based on attribute grammars
Journal of the ACM (JACM)
Annals of Mathematics and Artificial Intelligence
Decidable Containment of Recursive Queries
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Fixed-point semantics and the representation of algorithms on large data
VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases
The Well-Founded Semantics Is the Principle of Inductive Definition
JELIA '98 Proceedings of the European Workshop on Logics in Artificial Intelligence
The Descriptive Comlexity of the Fixed-Points of Bounded Formulas
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Partial Fixed-Point Logic on Infinite Structures
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
Extending Classical Logic with Inductive Definitions
CL '00 Proceedings of the First International Conference on Computational Logic
More about recursive structures: descriptive complexity and zero-one laws
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
On the expressive power of variable-confined logics
LICS '96 Proceedings of the 11th Annual IEEE Symposium on Logic in Computer Science
Uniform definability on finite structures with successor
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Guarded Quantification in Least Fixed Point Logic
Journal of Logic, Language and Information
Decidable containment of recursive queries
Theoretical Computer Science - Database theory
Fundamenta Informaticae
Boldface Recursion on Platek Spaces
Fundamenta Informaticae
Artificial Intelligence
A logic of nonmonotone inductive definitions
ACM Transactions on Computational Logic (TOCL)
Open answer set programming with guarded programs
ACM Transactions on Computational Logic (TOCL)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
One Useful Logic That Defines Its Own Truth
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
On the origins of bisimulation and coinduction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Constructive second-order proofs in logical databases
IJCAI'87 Proceedings of the 10th international joint conference on Artificial intelligence - Volume 2
Well-founded semantics and the algebraic theory of non-monotone inductive definitions
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
FO(ID) as an extension of DL with rules
Annals of Mathematics and Artificial Intelligence
Definability in the subword order
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Conservative extensions of abstract structures
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
On topological completeness of regular tree languages
Logic and Program Semantics
Fundamenta Informaticae
Boldface Recursion on Platek Spaces
Fundamenta Informaticae
RECURSIVE MODELS OF GENERAL INDUCTIVE TYPES
Fundamenta Informaticae
First-order expressibility and boundedness of disjunctive logic programs
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |