Linear Objects: logical processes with built-in inheritance

Linear Objects: logical processes with built-in inheritance (0)

Cached

Download Links

by Jean-marc Andreoli , Remo Pareschi

Venue:	New Generation Computing
Citations:	201 - 6 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Linear Objects: logical processes with built-in inheritance	user correction - Legacy Corrections
AUTHOR NAME	Jean-marc Andreoli	SVM HeaderParse 0.1
AUTHOR AFFIL	European Computer Industry Research Centre, Munich, Germany	SVM HeaderParse 0.2
AUTHOR NAME	Remo Pareschi	SVM HeaderParse 0.1
AUTHOR AFFIL	European Computer Industry Research Centre, Munich, Germany	SVM HeaderParse 0.2
ABSTRACT	We present a new framework for amalgamating two successful programming paradigms: logic programming and object-oriented programming. From the former, we keep the declarative reading of programs. From the latter, we select two crucial notions: (i) the ability for objects to dynamically change their internal state during the computation; (ii) the structured representation of knowledge, generally obtained via inheritance graphs among classes of objects. We start with the approach, introduced in concurrent logic programming languages, which identifies objects with proof processes and object states with arguments occurring in the goals of a given process. This provides a clean, side-effect free account of the dynamic behavior of objects in terms of the search tree --- the only dynamic entity in logic programming languages. We integrate this view of objects with an extension of logic programming, which we call Linear Objects, based on the possibility of having multiple literals in the head of a program clause. This contains within itself the basis for a flexible form of inheritance, and maintains the constructive property of Prolog of returning definite answer substitutions as output of the proof of non-ground goals. The theoretical background for Linear Objects is Linear Logic, a logic recently introduced to provide a theoretical basis for the study of concurrency. We also show that Linear Objects can be considered a constructive restriction of full Classical Logic. We illustrate the expressive power of Linear Objects compared to Prolog by several examples from the object-oriented domain, but we also show that it can be used to provide elegant solutions for problems arising in the standard style of logic programming. 1	user correction - Legacy Corrections
YEAR	0	user correction - Legacy Corrections
VENUE	New Generation Computing	INFERENCE
VENUE TYPE	JOURNAL	INFERENCE
PAGES	495--510	INFERENCE
VOLUME	9	INFERENCE
CITATIONS	26 found	ParsCit 1.0