Fixpoint extensions of first-order logic and datalog-like languages
Data up to Jan 2025
Total Citations Per Year
Abstract
References (20)
Principles of database and knowledge-base systems
1989 • 2,768 citations
Towards a Theory of Declarative Knowledge
1988 • 1,163 citations
Relational queries computable in polynomial time
1986 • 655 citations
Universality of data retrieval languages
1979 • 635 citations
Structure and complexity of relational queries
1982 • 539 citations
Computable queries for relational data bases
1980 • 444 citations
Logic and the Challenge of Computer Science
1985 • 326 citations
Horn clause queries and generalizations
1985 • 311 citations
Fixed-point extensions of first-order logic
1986 • 242 citations
Relative Information Capacity of Simple Relational Database Schemata
1986 • 220 citations
Elements of Relational Database Theory
1990 • 195 citations
Negation as failure using tight derivations for general logic programs
1989 • 119 citations
Procedural and declarative database update languages
1988 • 109 citations
Mathematical Logic and Hilbert's E-symbol
1969 • 109 citations
Programming primitives for database languages
1981 • 103 citations
Why not negation by fixpoint?
1988 • 91 citations
Minimalism subsumes Default Logic and Circumscription in Stratified Logic Programming
1987 • 59 citations
Negation as Failure Using Tight Derivations for General Logic Programs.
1986 • 56 citations
A Logic for Negation in Database Systems.
1986 • 48 citations
Fixed-point extensions of first-order logic
1985 • 45 citations