4401 search results - page 229 / 881 » Computing with Default Logic |
145
click to vote
GG
2004
Springer
15 years 10 months ago
2004
Springer
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
186
click to vote
ASP
2003
Springer
15 years 10 months ago
2003
Springer
We present a general method to improve computation of answer sets by analyzing structural properties of normal logic programs. Therefore we use labeled directed graphs associated t...
186
Voted
AGP
2010
IEEE
15 years 10 months ago
2010
IEEE
We review the Italian contribution to proof-theoretic and higher-order extensions of logic programming; this originated from the realization that Horn clauses lacked standard abstr...
168
Voted
ACIVS
2006
Springer
15 years 9 months ago
2006
Springer
The vision-based scene understanding technique that infers scene-interpreting contexts from real-world vision data has to not only deal with various uncertain environments but also...
151
Voted
ECML
2006
Springer
15 years 9 months ago
2006
Springer
This paper studies the PAC and agnostic PAC learnability of some standard function classes in the learning in higher-order logic setting introduced by Lloyd et al. In particular, i...