1943 search results - page 29 / 389 » Ordering Default Theories |
123
click to vote
ACL
1996
15 years 3 months ago
1996
In this paper, we show that Higher-Order Coloured Unification - a form of unification developed for automated theorem proving - provides a general theory for modeling the interfac...
114
Voted
BIRTHDAY
2006
Springer
15 years 5 months ago
2006
Springer
We give necessary and sufficient conditions for the first-order theory of a finitely presented abelian lattice-ordered group to be decidable. We also show that if the number of gen...
112
click to vote
AAAI
2010
15 years 3 months ago
2010
In this paper, we propose a translation from normal first-order logic programs under the answer set semantics to first-order theories on finite structures. Specifically, we introd...
AMAI
2002
Springer
15 years 1 months ago
2002
Springer
Probabilistic argumentation systems are based on assumption-based reasoning for obtaining arguments supporting hypotheses and on probability theory to compute probabilities of sup...
132
click to vote
KR
2004
Springer
15 years 7 months ago
2004
Springer
The causal logic from (Bochman 2003b) is shown to provide a natural logical basis for logic programming. More exactly, it is argued that any logic program can be seen as a causal ...