Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Unification as a complexity measure for logic programming
Journal of Logic Programming
Information Processing Letters
Towards a theory of declarative knowledge
Foundations of deductive databases and logic programming
Logic programming and databases
Logic programming and databases
A declarative semantics of flat guarded Horn clauses for programs with perpetual processes
Theoretical Computer Science - Special issue on the international conference on fifth generation computer systems. Tokyo, 1988
Machine models and simulations
Handbook of theoretical computer science (vol. A)
Handbook of theoretical computer science (vol. B)
The well-founded semantics for general logic programs
Journal of the ACM (JACM)
Symbolic model checking: 1020 states and beyond
Information and Computation - Special issue: Selections from 1990 IEEE symposium on logic in computer science
Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computer-aided verification of coordinating processes: the automata-theoretic approach
Computer-aided verification of coordinating processes: the automata-theoretic approach
Relational transducers for electronic commerce
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Model checking
Symbolic Model Checking
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
Reasoning about The Past with Two-Way Automata
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
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
Set-Based Analysis of Reactive Infinite-State Systems
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Logic Programming and Model Checking
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Efficient Model Checking Using Tabled Resolution
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Counterexample-Guided Abstraction Refinement
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Model Checking and Transitive-Closure Logic
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Design and Synthesis of Synchronization Skeletons Using Branching-Time Temporal Logic
Logic of Programs, Workshop
Handbook of automated reasoning
LICS '99 Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science
Constraint-Based Infinite Model Checking and Tabulation for Stratified CLP
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Proceedings of the 21st annual ACM SIGPLAN conference on Object-oriented programming systems, languages, and applications
Bounded Model Checking with Description Logic Reasoning
TABLEAUX '07 Proceedings of the 16th international conference on Automated Reasoning with Analytic Tableaux and Related Methods
| Hi-index | 0.00 |
We survey recent results about the relation between Datalog and temporal verification logics. Datalog is a well-known database query language relying on the logic programming paradigm. We introduce Datalog LITE, a fragment of Datalog with Well-founded negation, which has an easy stratified semantics and a linear time model checking algorithm. Datalog LITE subsumes temporal languages such as CTL and the alternation-free u-calculus. We give easy syntactic characterizations of these temporal languages by fragments of Datalog LITE, and show that Datalog LITE has the same expressive power as the alternation-free portion of guarded fixed point logic.