𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Implementing logical connectives in constraint programming

✍ Scribed by Christopher Jefferson; Neil C.A. Moore; Peter Nightingale; Karen E. Petrie

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
562 KB
Volume
174
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Temporal Annotated Constraint Logic Prog
Temporal Annotated Constraint Logic Programming
✍ THOM FRÜHWIRTH πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 712 KB

We introduce a family of logics and associated programming languages for representing and reasoning about time. The family is conceptually simple while allowing for different models of time. Formulae can be labelled with temporal information using annotations. In this way we avoid the proliferation

Constraint Satisfaction in Distributed C
Constraint Satisfaction in Distributed Concurrent Logic Programming
✍ HO-FUNG LEUNG; KEITH L. CLARK πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 602 KB

In constraint logic programming, unification is replaced by more general constraint satisfaction. To support constraint solving in a committed-choice concurrent logic programming language, the constraint solver also needs to determine the status of the 'ask'-constraints with respect to the current c

A neural implementation of multi-adjoint
A neural implementation of multi-adjoint logic programming
✍ J. Medina; E. MΓ©rida-Casermeiro; M. Ojeda-Aciego πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 253 KB

A neural net based implementation of propositional [0, 1]-valued multi-adjoint logic programming is presented, which is an extension of earlier work on representing logic programs in neural networks carried out in [A.S. d'Avila Garcez et al.,