507 search results - page 73 / 102 » Automating first-order relational logic |
153
click to vote
DLOG
2011
14 years 4 months ago
2011
W3C currently extends the SPARQL query language with so-called entailment regimes, which define how queries are evaluated using logical entailment relations. We describe a sound a...
111
Voted
ILP
2005
Springer
15 years 6 months ago
2005
Springer
Recursive loops in a logic program present a challenging problem to the PLP framework. On the one hand, they loop forever so that the PLP backward-chaining inferences would never s...
CSL
2004
Springer
15 years 6 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
113
Voted
JANCL
2008
15 years 18 days ago
2008
This paper employs epistemic logic to investigate the philosophical foundations of Bayesian updating in belief revision. By Bayesian updating, we understand the tenet that an agen...
122
click to vote
NMR
2004
Springer
15 years 6 months ago
2004
Springer
The development of Logic Programming and Defeasible Argumentation lead to Defeasible Logic Programming. Its core resides in the characterization of the warrant procedure. Defeasib...