Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
The art of Prolog (2nd ed.): advanced programming techniques
The art of Prolog (2nd ed.): advanced programming techniques
Vicious circles: on the mathematics of non-wellfounded phenomena
Vicious circles: on the mathematics of non-wellfounded phenomena
HYTECH: The Cornell HYbrid TECHnology Tool
Hybrid Systems II
Cyber Physical Systems: Design Challenges
ISORC '08 Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing
A logic-based modeling and verification of CPS
ACM SIGBED Review - Work-in-Progress (WiP) Session of the 2nd International Conference on Cyber Physical Systems
Infinite computation, co-induction and computational logic
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Verifying complex continuous real-time systems with coinductive CLP(R)
LATA'10 Proceedings of the 4th international conference on Language and Automata Theory and Applications
Co-logic programming: extending logic programming with coinduction
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
Constraint logic programming (CLP) has been proposed as a declarative paradigm for merging constraint solving and logic programming. Recently, coinductive logic programming has been proposed as a powerful extension of logic programming for handling (rational) infinite objects and reasoning about their properties. Coinductive logic programming does not include constraints while CLP's declarative semantics is given in terms of a least fixed-point (i.e., it is inductive) and cannot directly support reasoning about (rational) infinite objects and their properties. In this paper we combine constraint logic programming and coinduction to obtain co-constraint logic programming (co-CLP for brevity). We present the declarative semantics of co-CLP in terms of a greatest fixed-point and its operational semantics based on the coinductive hypothesis rule . We prove the equivalence of these two semantics for programs with rational terms.