3691 search results - page 100 / 739 » Bayesian Logic Programs |
118
Voted
ECP
1997
Springer
15 years 4 months ago
1997
Springer
We present a framework for encoding planning problems in logic programs with negation as failure, having computational e ciency as our major consideration. In order to accomplish o...
97
Voted
FOSSACS
2006
Springer
15 years 4 months ago
2006
Springer
We extend the propositional dynamic logic PDL of Fischer and Ladner with a restricted kind of recursive programs using the formalism of visibly pushdown automata (Alur, Madhusudan...
127
click to vote
WFLP
2000
Springer
15 years 4 months ago
2000
Springer
We describe the current status of the development of CFLP, a system which aims at the integration of the best features of functional logic programming (FLP), cooperative constrain...
102
Voted
AAAI
2004
15 years 2 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
126
click to vote
IJCAI
2003
15 years 2 months ago
2003
We consider the problem of updating nonmonotonic knowledge bases represented by epistemic logic programs where disjunctive information and notions of knowledge and beliefs can be ...