A Theory of Observables for Logic Programs

Comini, Marco; Levi, Giorgio; Meo, Maria Chiara

doi:10.1006/inco.2000.3024

Cited by 18 publications

(22 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Variable-free logic programs and SLD derivations over such programs bear a strong resemblance to finitely branching transition systems (see also [5,7]): atoms play the role of states, and the implication arrow ← used to define clauses plays the role of the transition relation. The main difference between logic programs and transition systems is that each atom is sent to the subset of subsets of atoms appearing in the program, and thus the finite powerset functor P f is iterated twice.…”

Section: Coalgebraic Semantics For Ground Logic Programsmentioning

confidence: 99%

“…Note that the result above relates to the Theory of Observables for logic programming developed in [7]. According to this theory, traditional characterisation of logic programs in terms of input/output behaviour is not sufficient for the purposes of program analysis and optimisation.…”

Section: Coalgebraic Semantics and Parallel Execution Of Logic Programsmentioning

confidence: 99%

“…Therefore, it is useful to have complete information about the SLD-derivation, e.g., the sequences of goals, most general unifiers, and variants of clauses. The following four observables are the most important for the theory [10,7].…”

Section: Coalgebraic Semantics and Parallel Execution Of Logic Programsmentioning

confidence: 99%

“…In Section 5, we show that the C(P f List)-coalgebra is a sound and complete semantics for and-or parallel SLD derivations. We prove that semantics given by C(P f List)-coalgebra is correct with respect to the Theory of Observables [7] for logic programming. In Section 6, we conclude the paper and discuss future work to be done.…”

Section: Introductionmentioning

confidence: 96%

“…Among the earliest results was the characterisation of the first-order language as a Lawvere theory [2,5,6,17], and most general unifiers (mgus) as equalisers [4] and pullbacks [6,2]. There were several approaches to operational semantics of logic programming, notably, built upon the observation that logic programs resemble transition systems or rewriting systems; [5,7].…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming

Komendantskaya

McCusker

Power

2011

Algebraic Methodology and Software Technology

View full text Add to dashboard Cite

Abstract. Logic programming, a class of programming languages based on first-order logic, provides simple and efficient tools for goal-oriented proof-search. Logic programming supports recursive computations, and some logic programs resemble the inductive or coinductive definitions written in functional programming languages. In this paper, we give a coalgebraic semantics to logic programming. We show that ground logic programs can be modelled by either P f P f -coalgebras or P f Listcoalgebras on Set. We analyse different kinds of derivation strategies and derivation trees (proof-trees, SLD-trees, and-or parallel trees) used in logic programming, and show how they can be modelled coalgebraically.

show abstract

Section: Coalgebraic Semantics For Ground Logic Programsmentioning

confidence: 99%

Section: Coalgebraic Semantics and Parallel Execution Of Logic Programsmentioning

confidence: 99%

Section: Coalgebraic Semantics and Parallel Execution Of Logic Programsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 96%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming

Komendantskaya

McCusker

Power

2011

Algebraic Methodology and Software Technology

View full text Add to dashboard Cite

show abstract

Indexed Categories and Bottom-Up Semantics of Logic Programs

Amato

Lipton

2001

Logic for Programming, Artificial Intelligence, and Reasoning

View full text Add to dashboard Cite

Declarative Compilation for Constraint Logic Programming

Arias

Lipton

Mariño

2015

Logic-Based Program Synthesis and Transformation

View full text Add to dashboard Cite

The aim of the LOPSTR series is to stimulate and promote international research and collaboration on logic-based program development. LOPSTR is open to contributions in all aspects of logic-based program development, all stages of the software life cycle, and issues of both programming-in-the-small and programming-in-the-large. LOPSTR traditionally solicits contributions, in any language paradigm, in the areas of synthesis, specification, transformation, analysis and verification, specialization, testing and certification, composition, program/model manipulation, optimization, transformational techniques in software engineering, inversion, applications, and tools. LOPSTR has a reputation for being a lively, friendly forum for presenting and discussing work in progress. Formal proceedings are produced only after the symposium so that authors can incorporate this feedback in the published papers. In response to the call for papers, 34 contributions were submitted from 21 different countries. The Program Committee accepted 7 full papers for immediate inclusion in the formal proceedings, and 11 more papers presented at the symposium were accepted after a revision and another round of reviewing. Each submission was reviewed by at least 2 and on the average 3.0, Program Committee members or external referees. In addition to the 18 contributed papers, this volume includes the abstracts of the invited talks by two outstanding speakers: Roberto Giacobazzi (University of Verona, Italy), shared with PPDP and Viktor Kuncak (EPFL, Switzerland). We would like to thank the Program Committee members, who worked diligently to produce high-quality reviews for the submitted papers, as well as all the external reviewers involved in the paper selection. We are very grateful to the LOPSTR 2014 General Co-chairs, Olaf Chitil and Andy King, and the local organizers for the great job they did in managing the symposium. Many thanks also to Olivier Danvy, the Program Committee Chair of PPDP, with whom we often interacted for coordinating the two events. We are grateful to Emanuele De Angelis and Fabrizio Smith, who helped us in maintaining the LOPSTR web site and editing these proceedings. We would also like to thank Andrei Voronkov for his excellent EasyChair system that automates many of the tasks involved in chairing a conference. Special thanks go to all

show abstract

A Theory of Observables for Logic Programs

Cited by 18 publications

References 20 publications

Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming

Coalgebraic Semantics for Parallel Derivation Strategies in Logic Programming

Indexed Categories and Bottom-Up Semantics of Logic Programs

Declarative Compilation for Constraint Logic Programming

Contact Info

Product

Resources

About