LOGIN: A Logic Programming Language with Built-In Inheritance

  title={LOGIN: A Logic Programming Language with Built-In Inheritance},
  author={Hassan A{\"i}t-Kaci and Roger Nasr},
  journal={J. Log. Program.},

Figures from this paper

Logic and inheritance

An elaboration of the Prolog language is described in which the notion of first-order term is replaced by a more general one, which allows the integration of inheritance directly into the unification process rather than indirectly through the resolution-based inference mechanism of Prolog.

Taxonomical Reasoning in Logic Programming

The Extended Prolog with Order-Sorted resolution (EPOS) supports data abstraction and inheritance mechanisms and offers an enhanced language expressiveness resulting in shorter programs.

Queer: a Prolog-based Prototype for an Extended Er Approach

With the system Queer, this work introduces the prototype of a Prolog-based information system which directly supports an extended entity-relationship model on its front-end and uses a semantically well-founded query and manipulation language based on an entity- Relationship calculus.

Netlog - A Concept Oriented Logic Programming Language

A superset of Prolog language is described which covers the main properties of such knowledge representation formalisms as frames and semantic nets in the framework of the Tseytin's approach to programming with association nets.

LOOP-a language for LP-based AI applications

One major drawback of logic programming, particularly Prolog, is the lack of mechanisms for structuring knowledge (i.e. program clauses). This makes programming-in-the-large a difficult task even

Well-founded semantics and stratification for ordered logic programs

An extension of traditional logic programming, called ordered logic (OL) programming, is presented to support classical negation as well as constructs from the object-oriented paradigm to cope with the notions of object, multiple inheritance and non-monotonic reasoning.

COMPLEX: An Object-Oriented Logic Programming System

The design and a prototypical implementation of COMPLEX, which is a logic-based system extended with concepts from the object-oriented paradigm and is intended as a tool for the development of

Integrating data type inheritance into logic programming

This document describes a particular facet of an experimental programming model whose design is the objective of the on-going research at MCC — the e programming environment, which combines type inheritance and logic programming — a prototype named LOGIN.



A Machine-Oriented Logic Based on the Resolution Principle

The paper concludes with a discussion of several principles which are applicable to the design of efficient proof-procedures employing resolution as the basle logical process.

A lattice theoretic approach to computation based on a calculus of partially ordered type structures (property inheritance, semantic nets, graph unification)

A formal lattice-theoretic calculus of partially ordered type structures where the ordering is meant to reflect subtyping is defined and a model of computation which amounts to solving systems of simultaneous equations in a lattice of types is proposed.

Logic for Data Description

Both the static and dynamic management of data bases depends upon the form of definitions, and when logic is used to describe information, the conventional distinction between data bases and programs no longer applies.

Krypton: A Functional Approach to Knowledge Representation

The authors have developed a design strategy for avoiding these types of problems and have implemented a representation system based on it, called Krypton, which clearly distinguishes between definitional and factual information.

What's in a Semantic Network?

This paper presents a representation language in the notation of FOPC whose form facilitates the design of a semantic-network-like retriever.

The Design and Analysis of Computer Algorithms

This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.

Logic and semantic networks

By regarding semantic networks as an abstract data structure for the representation of clauses, this work provides a theorem-prover with a potentially useful indexing scheme and path-following strategy for guiding the search for a proof.