Executing temporal logic programs
Executing temporal logic programs
Languages, automata, and logic
Handbook of formal languages, vol. 3
Process logic: preliminary report
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A Hardware Semantics Based on Temporal Intervals
Proceedings of the 10th Colloquium on Automata, Languages and Programming
An Automata-Theoretic Completeness Proof for Interval Temporal Logic
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
A Combination of Clausal and Non Clausal Temporal Logic Programs
IJCAI '93 Proceedings of the Workshop on Executable Modal and Temporal Logics
Compositional Reasoning Using Interval Temporal Logic and Tempura
COMPOS'97 Revised Lectures from the International Symposium on Compositionality: The Significant Difference
A Tableau Method for Interval Temporal Logic with Projection
TABLEAUX '98 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Some Very Compositional Temporal Properties
PROCOMET '94 Proceedings of the IFIP TC2/WG2.1/WG2.2/WG2.3 Working Conference on Programming Concepts, Methods and Calculi
Gentzen-Systems for Propositional Temporal Logics
CSL '88 Proceedings of the 2nd Workshop on Computer Science Logic
Refining Interval Temporal Logic Specifications
ARTS '97 Proceedings of the 4th International AMAST Workshop on Real-Time Systems and Concurrent and Distributed Software: Transformation-Based Reactive Systems Development
Complete Proof Systems for First Order Interval Temporal Logic
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
A Complete Proof Systems for QPTL
LICS '95 Proceedings of the 10th Annual IEEE Symposium on Logic in Computer Science
Compositional reasoning about projected and infinite time
ICECCS '95 Proceedings of the 1st International Conference on Engineering of Complex Computer Systems
Reasoning about digital circuits
Reasoning about digital circuits
Semantical consideration on floyo-hoare logic
SFCS '76 Proceedings of the 17th Annual Symposium on Foundations of Computer Science
On the complexity of omega -automata
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Mexitl: Multimedia in Executable Interval Temporal Logic
Formal Methods in System Design
An Automata-Theoretic Completeness Proof for Interval Temporal Logic
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Modeling and optimal control based on logic methods in water industry systems
MIC'06 Proceedings of the 25th IASTED international conference on Modeling, indentification, and control
Science of Computer Programming
Decidability of propositional projection temporal logic with infinite models
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Machine-assisted proof support for validation beyond Simulink
ICFEM'07 Proceedings of the formal engineering methods 9th international conference on Formal methods and software engineering
Partial, total and general correctness
MPC'10 Proceedings of the 10th international conference on Mathematics of program construction
Unifying recursion in partial, total and general correctness
UTP'10 Proceedings of the Third international conference on Unifying theories of programming
An improved decision procedure for propositional projection temporal logic
ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Deriving real-time action systems controllers from multiscale system specifications
MPC'12 Proceedings of the 11th international conference on Mathematics of Program Construction
Towards an algebra for real-time programs
RAMiCS'12 Proceedings of the 13th international conference on Relational and Algebraic Methods in Computer Science
A survey on temporal logics for specifying and verifying real-time systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
Interval Temporal Logic (ITL) is formalism for reasoning about times. To date no one has proved completeness of a relatively simple ITL deductive system supporting infinite time and permitting infinite sequential iteration comparable to omega-regular expressions. We give a complete axiomatization for such a version of quantified ITL over finite domains and can show completeness by representing finite-state automata in ITL and then translating ITL formulas into them. The full paper (and another conference paper) presents the basic framework for finite time. Here and in the full paper the axiom system (and completeness) is extended to infinite time.