4573 search results - page 674 / 915 » Automated Reasoning |
144
click to vote
LOPSTR
2009
Springer
15 years 10 months ago
2009
Springer
In this work, we first consider a goal-oriented extension of the dependency pair framework for proving termination w.r.t. a given set of initial terms. Then, we introduce a new re...
125
click to vote
LPNMR
2009
Springer
15 years 10 months ago
2009
Springer
We consider random logic programs with two-literal rules and study their properties. In particular, we obtain results on the probability that random “sparse” and “dense” pr...
132
click to vote
LPNMR
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We study the complexity of consistency checking and query answering on incomplete databases for languages ranging from non-recursive Datalog to disjunctive Datalog with n...
119
click to vote
RR
2009
Springer
15 years 10 months ago
2009
Springer
Our previous work [26] introduced Belief Logic Programming (BLP), a novel form of quantitative logic programming with correlation of evidence. Unlike other quantitative approaches ...
98
Voted
TARK
2009
Springer
15 years 10 months ago
2009
Springer
ity and the speed of decision-making (extended abstract) Michael Mandler Department of Economics Royal Holloway College, University of London Egham, Surrey TW20 0EX United Kingdom ...