Co-logic programming: extending logic programming with coinduction

Authors:
Luke Simon;Ajay Bansal;Ajay Mallya;Gopal Gupta
Affiliations:
Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science, University of Texas at Dallas, Richardson, TX;Department of Computer Science, University of Texas at Dallas, Richardson, TX
Venue:
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Year:
2007

Citing 5
Cited 16

Semantics of infinite tree logic programming

Theoretical Computer Science
Logic programming

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
On a Tabling Engine That Can Exploit Or-Parallelism

Proceedings of the 17th International Conference on Logic Programming
Coinductive logic programming

ICLP'06 Proceedings of the 22nd international conference on Logic Programming

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
Complete coinductive subtyping for abstract compilation of object-oriented languages

Proceedings of the 12th Workshop on Formal Techniques for Java-Like Programs
Coalgebraic semantics for parallel derivation strategies in logic programming

AMAST'10 Proceedings of the 13th international conference on Algebraic methodology and software technology
Abstract compilation of object-oriented languages into coinductive CLP(X): can type inference meet verification?

FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
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
Coalgebraic semantics for derivations in logic programming

CALCO'11 Proceedings of the 4th international conference on Algebra and coalgebra in computer science
Coinductive logic programming with negation

LOPSTR'09 Proceedings of the 19th international conference on Logic-Based Program Synthesis and Transformation
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
Regular corecursion in Prolog

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
Coinductive constraint logic programming

FLOPS'12 Proceedings of the 11th international conference on Functional and Logic 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
Safe corecursion in coFJ

Proceedings of the 15th Workshop on Formal Techniques for Java-like Programs
Regular corecursion in Prolog

Computer Languages, Systems and Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present the theory and practice of co-logic programming (co-LP for brevity), a paradigm that combines both inductive and coinductive logic programming. Co-LP is a natural generalization of logic programming and coinductive logic programming, which in turn generalizes other extensions of logic programming, such as infinite trees, lazy predicates, and concurrent communicating predicates. Co-LP has applications to rational trees, verifying infinitary properties, lazy evaluation, concurrent LP, model checking, bisimilarity proofs, etc.