JFPLC
13 years 7 months ago
2004
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...
CADE
14 years 6 months ago
2004 Springer
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...
LANMR
13 years 7 months ago
2004
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...
AIML
13 years 7 months ago
2004
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...
CADE
14 years 6 months ago
2004 Springer
Interactive theorem provers can model complex systems, but require much effort to prove theorems. Resolution theorem provers are automatic and powerful, but they are designed to be...
|