109
click to vote
JFPLC
14 years 10 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...
106
click to vote
LANMR
14 years 10 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...
106
click to vote
AIML
14 years 10 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
LANMR
14 years 10 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...
LANMR
14 years 10 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...
|
Logical Reasoning