Sciweavers

JFPLC
2004
13 years 6 months ago
Explications pour comprendre la trace d'un solveur de contraintes sur domaines finis
ABSTRACT. Some works in progress on finite domain constraint solvers concern the implementation of a XML trace of the computation according to the OADymPPaC DTD (for example in GNU...
Gérard Ferrand, Willy Lesaint, Alexandre Te...
LANMR
2004
13 years 6 months ago
Computing Preferred Safe Beliefs
We recently proposed a definition of a language for nonmonotonic reasoning based on intuitionistic logic. Our main idea is a generalization of the notion of answer sets for arbitr...
Luis A. Montiel, Juan A. Navarro
CADE
2004
Springer
14 years 5 months ago
The ICS Decision Procedures for Embedded Deduction
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
Leonardo Mendonça de Moura, Sam Owre, Haral...
AIML
2004
13 years 6 months ago
On the Formal Structure of Continuous Action
abstract. Analytical investigations of agency are mostly concerned with a description ex post acto. However, continuous action (being doing something) needs to be considered as wel...
Thomas Müller
CADE
2004
Springer
14 years 5 months ago
Lambda Logic
Lambda logic is the union of first order logic and lambda calculus. We prove basic metatheorems for both total and partial versions of lambda logic. We use lambda logic to state a...
Michael Beeson
Logical Reasoning
Top of PageReset Settings