Isoinitial Semantics for Logic Programs

Authors:
Kung-Kiu Lau;Mario Ornaghi
Affiliations:
-;-
Venue:
CL '00 Proceedings of the First International Conference on Computational Logic
Year:
2000

Citing 6
Cited 2

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Modular logic programming

ACM Transactions on Programming Languages and Systems (TOPLAS)
Logical features of Horn Clauses

Handbook of logic in artificial intelligence and logic programming (vol. 1)
A compositional semantics for logic programs

FGCS'921 Selected papers of the conference on Fifth generation computer systems
Abstract parametric classes and abstract data types defined by classical and constructive logical methods

Journal of Symbolic Computation
On Dynamic Aspects of OOD Frameworks in Component-Based Software Development in Computational Logic

LOPSTR'99 Selected papers from the 9th International Workshop on Logic Programming Synthesis and Transformation

Logic for Component-Based Software Development

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Correct Object-Oriented Systems in Computational Logic

LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Herbrand model H of a definite logic program P is an initial model among the class of all the models of P, interpreting P as an initial theory. Such a theory (program) proves (computes) only positive literals (atoms) in P, so it does not deal with negation. In this paper, we introduce isoinitial semantics for logic programs and show that it can provide a rich semantics for logic programs, which can deal with not just negation, but also incomplete information, parametricity and compositionality.