Relational queries computable in polynomial time
Information and Control
A programming language for the inductive sets, and applications
Information and Control
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Languages that capture complexity classes
SIAM Journal on Computing
Computation theory and logic
Skolem normal forms concerning the least fixpoint
Computation theory and logic
Principles of database and knowledge-base systems, Vol. I
Principles of database and knowledge-base systems, Vol. I
An introduction to database systems: vol. 1 (5th ed.)
An introduction to database systems: vol. 1 (5th ed.)
The expressive power of stratified logic programs
Information and Computation
Elements of relational database theory
Handbook of theoretical computer science (vol. B)
A model of concurrency with fair merge and full recursion
Information and Computation
Nondeterminacy and recursion via stacks and games
Theoretical Computer Science
Reasoning about knowledge
Pebble games and subroutines in least fixed point logic
Information and Computation
Vicious circles: on the mathematics of non-wellfounded phenomena
Vicious circles: on the mathematics of non-wellfounded phenomena
Exploring logical dynamics
Communicating and mobile systems: the &pgr;-calculus
Communicating and mobile systems: the &pgr;-calculus
A relational model of data for large shared data banks
Communications of the ACM
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Refinement Calculus: A Systematic Introduction
Refinement Calculus: A Systematic Introduction
Universality of data retrieval languages
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Extensive Games as Process Models
Journal of Logic, Language and Information
Realizable and Unrealizable Specifications of Reactive Systems
ICALP '89 Proceedings of the 16th International Colloquium on Automata, Languages and Programming
CSL '91 Proceedings of the 5th Workshop on Computer Science Logic
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
Elementary induction on abstract structures (Studies in logic and the foundations of mathematics)
| Hi-index | 0.00 |
We develop a variant of Least Fixed Point logic based on First Orderlogic with a relaxed version of guarded quantification. We develop aGame Theoretic Semantics of this logic, and find that under reasonableconditions, guarding quantification does not reduce the expressibilityof Least Fixed Point logic. But we also find that the guarded version ofa least fixed point algorithm may have a greater time complexity thanthe unguarded version, by a linear factor.