Co-logic programming: Extending logic programming with coinduction

Luke Simon, Ajay Bansal, Ajay Mallya, Gopal Gupta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

44 Citations (Scopus)

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.

Original languageEnglish (US)
Title of host publicationAutomata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings
Pages472-483
Number of pages12
StatePublished - Dec 1 2007
Externally publishedYes
Event34th International Colloquium on Automata, Languages and Programming, ICALP 2007 - Wroclaw, Poland
Duration: Jul 9 2007Jul 13 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4596 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other34th International Colloquium on Automata, Languages and Programming, ICALP 2007
CountryPoland
CityWroclaw
Period7/9/077/13/07

Fingerprint

Coinduction
Logic programming
Logic Programming
Predicate
Concurrent
Model checking
Model Checking
Paradigm
Generalise
Evaluation

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Simon, L., Bansal, A., Mallya, A., & Gupta, G. (2007). Co-logic programming: Extending logic programming with coinduction. In Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings (pp. 472-483). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4596 LNCS).

Co-logic programming : Extending logic programming with coinduction. / Simon, Luke; Bansal, Ajay; Mallya, Ajay; Gupta, Gopal.

Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings. 2007. p. 472-483 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4596 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Simon, L, Bansal, A, Mallya, A & Gupta, G 2007, Co-logic programming: Extending logic programming with coinduction. in Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4596 LNCS, pp. 472-483, 34th International Colloquium on Automata, Languages and Programming, ICALP 2007, Wroclaw, Poland, 7/9/07.
Simon L, Bansal A, Mallya A, Gupta G. Co-logic programming: Extending logic programming with coinduction. In Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings. 2007. p. 472-483. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Simon, Luke ; Bansal, Ajay ; Mallya, Ajay ; Gupta, Gopal. / Co-logic programming : Extending logic programming with coinduction. Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings. 2007. pp. 472-483 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{592bc8cc8b9c48bfa20ed6c3ebb1900a,
title = "Co-logic programming: Extending logic programming with coinduction",
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.",
author = "Luke Simon and Ajay Bansal and Ajay Mallya and Gopal Gupta",
year = "2007",
month = "12",
day = "1",
language = "English (US)",
isbn = "3540734198",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "472--483",
booktitle = "Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings",

}

TY - GEN

T1 - Co-logic programming

T2 - Extending logic programming with coinduction

AU - Simon, Luke

AU - Bansal, Ajay

AU - Mallya, Ajay

AU - Gupta, Gopal

PY - 2007/12/1

Y1 - 2007/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=38149118049&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=38149118049&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:38149118049

SN - 3540734198

SN - 9783540734192

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 472

EP - 483

BT - Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings

ER -