Semantics of infinite tree logic programming
Theoretical Computer Science
Handbook of theoretical computer science (vol. B)
Vicious circles: on the mathematics of non-wellfounded phenomena
Vicious circles: on the mathematics of non-wellfounded phenomena
Types and programming languages
Types and programming languages
On a Tabling Engine That Can Exploit Or-Parallelism
Proceedings of the 17th International Conference on Logic Programming
On the Interpretation of Infinite Computations in Logic Programming
Proceedings of the 11th Colloquium on Automata, Languages and Programming
Efficient Model Checking Using Tabled Resolution
CAV '97 Proceedings of the 9th International Conference on Computer Aided Verification
Logic Programming and Co-inductive Definitions
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
A constraint-based approach for specification and verification of real-time systems
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
A CLP Proof Method for Timed Automata
RTSS '04 Proceedings of the 25th IEEE International Real-Time Systems Symposium
Deductive multi-valued model checking
ICLP'05 Proceedings of the 21st international conference on Logic Programming
Coinductive big-step operational semantics
Information and Computation
ActionScript bytecode verification with co-logic programming
Proceedings of the ACM SIGPLAN Fourth Workshop on Programming Languages and Analysis for Security
Type Inference by Coinductive Logic Programming
Types for Proofs and Programs
Coinductive Type Systems for Object-Oriented Languages
Genoa Proceedings of the 23rd European Conference on ECOOP 2009 --- Object-Oriented Programming
Coinductive logic programming and its applications
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Transformations of logic programs on infinite lists
Theory and Practice of Logic Programming
Complete coinductive subtyping for abstract compilation of object-oriented languages
Proceedings of the 12th Workshop on Formal Techniques for Java-Like Programs
FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
Infinite computation, co-induction and computational logic
CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Coinductive big-step operational semantics for type soundness of Java-like languages
Proceedings of the 13th Workshop on Formal Techniques for Java-Like Programs
Model-checking in-lined reference monitors
VMCAI'10 Proceedings of the 11th international conference on Verification, Model Checking, and Abstract Interpretation
Coinductive logic programming with negation
LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
Theory and Practice of Logic Programming - Prolog Systems
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Corecursive Featherweight Java
Proceedings of the 14th Workshop on Formal Techniques for Java-like Programs
Proving properties of co-logic programs by unfold/fold transformations
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Soundness of object-oriented languages with coinductive big-step semantics
ECOOP'12 Proceedings of the 26th European conference on Object-Oriented Programming
Co-logic programming: extending logic programming with coinduction
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Static single information form for abstract compilation
TCS'12 Proceedings of the 7th IFIP TC 1/WG 202 international conference on Theoretical Computer Science
Language constructs for non-well-founded computation
ESOP'13 Proceedings of the 22nd European conference on Programming Languages and Systems
Proceedings of the 15th Workshop on Formal Techniques for Java-like Programs
Computer Languages, Systems and Structures
Proving Theorems by Program Transformation
Fundamenta Informaticae - To Andrzej Skowron on His 70th Birthday
Hi-index | 0.00 |
We extend logic programming’s semantics with the semantic dual of traditional Herbrand semantics by using greatest fixed-points in place of least fixed-points. Executing a logic program then involves using coinduction to check inclusion in the greatest fixed-point. The resulting coinductive logic programming language is syntactically identical to, yet semantically subsumes logic programming with rational terms and lazy evaluation. We present a novel formal operational semantics that is based on synthesizing a coinductive hypothesis for this coinductive logic programming language. We prove that this new operational semantics is equivalent to the declarative semantics. Our operational semantics lends itself to an elegant and efficient goal directed proof search in the presence of rational terms and proofs. We describe a prototype implementation of this operational semantics along with applications of coinductive logic programming.