Combining object-oriented and logic paradigms: A modal logic programming approach

1992 ◽  
pp. 98-113 ◽  
Author(s):  
Tarmo Uustalu
Keyword(s):  
Modal Logic ◽  
Logic Programming ◽  
Object Oriented ◽  
Programming Approach

scholarly journals Constraint Logic Programming Approach for Dynamic Traffic Signal Control

2000 ◽  
Vol 33 (17) ◽  
pp. 897-902
Author(s):  
Kelwyn D'Souza ◽  
Tomasz Borowiecki ◽  
Zbigniew Banaszak
Keyword(s):  
Logic Programming ◽  
Constraint Logic Programming ◽  
Traffic Signal ◽  
Programming Approach ◽  
Signal Control ◽  
Traffic Signal Control ◽  
Dynamic Traffic

A Modal Semantics of Negation in Logic Programming

1992 ◽  
Vol 16 (3-4) ◽  
pp. 231-262
Author(s):  
Philippe Balbiani
Keyword(s):  
Modal Logic ◽  
Logic Programming ◽  
Modal Logics ◽  
Kripke Models ◽  
Logic Programs ◽  
Modal Semantics ◽  
Soundness And Completeness ◽  
Modal Completion ◽  
Well Foundedness

The beauty of modal logics and their interest lie in their ability to represent such different intensional concepts as knowledge, time, obligation, provability in arithmetic, … according to the properties satisfied by the accessibility relations of their Kripke models (transitivity, reflexivity, symmetry, well-foundedness, …). The purpose of this paper is to study the ability of modal logics to represent the concepts of provability and unprovability in logic programming. The use of modal logic to study the semantics of logic programming with negation is defended with the help of a modal completion formula. This formula is a modal translation of Clack’s formula. It gives soundness and completeness proofs for the negation as failure rule. It offers a formal characterization of unprovability in logic programs. It characterizes as well its stratified semantics.

Adding Prolog Rules and OOPs Inheritance to Legacy Databases

1991 ◽  
Author(s):  
Art Goldschmidt ◽  
Dipayan Gangopadhyay
Keyword(s):  
Logic Programming ◽  
Programming Language ◽  
Object Oriented ◽  
Database System ◽  
Storage Management ◽  
Complex Objects ◽  
Rule Based ◽  
System Product ◽  
Viable Approach ◽  
Trigger Mechanisms

Abstract We present a viable approach to add rules capability or object orientation to legacy databases. Using a combination of language compilation, run-time trigger mechanisms and inter-language call facility, we integrate an object-oriented logic programming language, called OOLP, with an existing CIM Database System Product, IBM’s CIM CDF. The result is a system that provides storage management of complex objects, rule-based validation, object oriented knowledge modelling and declarative query capability.

A specification logic for concurrent object-oriented programming

1999 ◽  
Vol 9 (3) ◽  
pp. 253-286 ◽  
Author(s):  
G. DELZANNO ◽  
D. GALMICHE ◽  
M. MARTELLI
Keyword(s):  
Logic Programming ◽  
Programming Languages ◽  
Linear Logic ◽  
Operational Semantics ◽  
Object Oriented ◽  
Object Oriented Programming ◽  
Higher Order Logic ◽  
Specification Logic ◽  
Theoretic Characterization

This paper focuses on the use of linear logic as a specification language for the operational semantics of advanced concepts of programming such as concurrency and object-orientation. Our approach is based on a refinement of linear logic sequent calculi based on the proof-theoretic characterization of logic programming. A well-founded combination of higher-order logic programming and linear logic will be used to give an accurate encoding of the traditional features of concurrent object-oriented programming languages, whose corner-stone is the notion of encapsulation.

Sign in / Sign up

Export Citation Format

Share Document