114
click to vote
JFPLC
14 years 11 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...
113
click to vote
LANMR
14 years 11 months ago
2004
Hybrid probabilistic programs framework [5] is a variation of probabilistic annotated logic programming approach, which allows the user to explicitly encode the available knowledge...
110
click to vote
LANMR
14 years 11 months ago
2004
In previous work we have discussed the importance of identifying the cycles that occur in a logic program under the answer set semantics, and the connections between cycles, that w...
109
click to vote
AIML
14 years 11 months ago
2004
abstract. The aim of the present paper is to analyze the complexity of strict implication (together with falsum, conjunction and disjunction). We prove that Ladner's Theorem r...
100
click to vote
CADE
15 years 10 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...
|
Logical Reasoning