3470 search results - page 259 / 694 » Head-Elementary-Set-Free Logic Programs |
150
click to vote
ICLP
2007
Springer
16 years 21 days ago
2007
Springer
We propose a novel technique that maps decision problems in WS1S (weak monadic second-order logic with n successors) to the problem of query evaluation of Complex-value Datalog que...
178
click to vote
LPNMR
2007
Springer
16 years 20 days ago
2007
Springer
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
163
click to vote
ESWS
2009
Springer
16 years 1 months ago
2009
Springer
Open Answer Set Programming (OASP) is an attractive framework for integrating ontologies and rules. Although several decidable fragments of OASP have been identified, few reasonin...
152
click to vote
LPNMR
2005
Springer
16 years 1 days 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 ...
177
click to vote
LOPSTR
2004
Springer
15 years 12 months ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...