778 search results - page 66 / 156 » Expressiveness and complexity of graph logic |
122
click to vote
EUROPAR
2004
Springer
15 years 6 months ago
2004
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing answers to subgoals. The declarative nature of tabled logic program...
98
Voted
PPDP
2007
Springer
15 years 6 months ago
2007
Springer
We propose a new definition and use of a primitive getAllValues, for computing all the values of a non-deterministic expression in a functional logic program. Our proposal restri...
84
Voted
SEKE
2004
Springer
15 years 5 months ago
2004
Springer
In this work, we present an application of the Fuzzy Logic in the field of prediction in Software Engineering. We specifically use the Fuzzy Prototypical Knowledge Discovery for ch...
96
Voted
KI
2006
Springer
15 years 14 days ago
2006
Springer
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constr...
118
Voted
AMAI
2004
Springer
15 years 12 days ago
2004
Springer
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...