37 search results - page 2 / 8 » Splitting a Logic Program Revisited |
LPNMR
2005
Springer
13 years 10 months ago
2005
Springer
Two approaches to logic programming with probabilities emerged over time: bayesian reasoning and probabilistic satisfiability (PSAT). The attractiveness of the former is in tying ...
ILP
2004
Springer
13 years 10 months ago
2004
Springer
For the last ten years a lot of work has been devoted to propositionalization techniques in relational learning. These techniques change the representation of relational problems t...
FLOPS
2008
Springer
13 years 6 months ago
2008
Springer
AAAI
2000
13 years 6 months ago
2000
In this paper, we consider a method of computing minimal models in circumscription using integer programming in propositional logic and first-order logic with domain closure axiom...
LPNMR
2007
Springer
13 years 11 months ago
2007
Springer
Practically all programming languages used in software engineering allow to split a program into several modules. For fully declarative and nonmonotonic logic programming languages...