870 search results - page 111 / 174 » Theoretical and experimental results on the goal-plan tree p... |
COMPULOG
1999
Springer
15 years 2 months ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
FOIKS
2008
Springer
2008
Springer
Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach
14 years 11 months ago
There are a number of frameworks for modelling argumentation in logic. They incorporate a formal representation of individual arguments and techniques for comparing conflicting arg...
COMMA
2008
14 years 11 months ago
2008
Abstract Classical propositional logic is an appealing option for modelling argumentation but the computational viability of generating an argument is an issue. Here we propose ame...
111
click to vote
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
Integration over a domain, such as a Euclidean space or a Riemannian manifold, is a fundamental problem across scientific fields. Many times, the underlying domain is only acces...
168
click to vote
SIGMOD
2008
ACM
15 years 10 months ago
2008
ACM
We study the problem of querying relational data embedded in XML. Relational data can be represented by various tree structures in XML. However, current XML query methods, such as...