2303 search results - page 225 / 461 » On the logic of argumentation theory |
167
click to vote
IJCNN
2008
IEEE
16 years 1 months ago
2008
IEEE
—Modeling of complex phenomena such as the mind presents tremendous computational complexity challenges. The neural modeling fields theory (NMF) addresses these challenges in a n...
168
click to vote
GG
2004
Springer
16 years 14 hour 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 ...
217
click to vote
AGP
2010
IEEE
15 years 11 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...
166
click to vote
AAAI
2004
15 years 8 months ago
2004
We propose and study extensions of logic programming with constraints represented as generalized atoms of the form C(X), where X is a finite set of atoms and C is act constraint (...
150
click to vote
CCIA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. The operation of base contraction was successfully characterized for a very general class of logics using the notion of remainder sets. Although, in the general case, thi...