Premium
DISLOG: programming in logic with discontinuities
Author(s) -
SaintDizier Patrick
Publication year - 1990
Publication title -
computational intelligence
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.353
H-Index - 52
eISSN - 1467-8640
pISSN - 0824-7935
DOI - 10.1111/j.1467-8640.1990.tb00291.x
Subject(s) - prolog , programming language , computer science , extension (predicate logic) , logic programming , tree traversal , declarative programming , datalog , simple (philosophy) , artificial intelligence , inductive programming , theoretical computer science , programming paradigm , philosophy , epistemology
In this paper, we present an extension to PROLOG we call DISLOG which is designed to deal with relations between non‐contiguous elements in a structure. This extension turns out to be well suited for syntactic analysis of natural and artificial languages. It is also well adapted to express traversal constraints in applications such as planning and expert systems and deductive systems involving, for example, temporal reasoning, DISLOG belongs to the constrained logic programming paradigm and turns out to be more declarative, transparent, and simple than PROLOG to deal with longdistance relations.