3 citations · 3 across the 4 of their papers we have counts for
4 papers
Quantified Constraint Handling Rules
Vincent Barichard, Igor Stéphan
We shift the QCSP (Quantified Constraint Satisfaction Problems) framework to the QCHR (Quantified Constraint Handling Rules) framework by enabling dynamic binder and access to user…
Compilation for QCSP
Igor Stéphan
We propose in this article a framework for compilation of quantified constraint satisfaction problems (QCSP). We establish the semantics of this formalism by an interpretation to a…
Description of GADEL
I. Stephan, F. Saubion, P. Nicolas
This article describes the first implementation of the GADEL system : a Genetic Algorithm for Default Logic. The goal of GADEL is to compute extensions in Reiter's default logic. I…
Genetic Algorithms for Extension Search in Default Logic
P. Nicolas, F. Saubion, I. Stephan
A default theory can be characterized by its sets of plausible conclusions, called its extensions. But, due to the theoretical complexity of Default Logic (Sigma_2p-complete), the…