2834 search results - page 370 / 567 » Representing Trees with Constraints |
155
click to vote
ICDT
1997
ACM
15 years 10 months ago
1997
ACM
We develop a new schema for unstructured data. Traditional schemas resemble the type systems of programming languages. For unstructured data, however, the underlying type may be mu...
148
click to vote
ICLP
1994
Springer
15 years 10 months ago
1994
Springer
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
154
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
This paper studies a logical framework for automated negotiation between two agents. We suppose an agent who has a knowledge base represented by a logic program. Then, we introduc...
156
click to vote
ATAL
2006
Springer
15 years 10 months ago
2006
Springer
This paper proposes a general solution model using agent technology in order to solve two critical open issues in the course timetabling problem: application-specific issues and d...
172
click to vote
ECAI
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We investigate different evaluation strategies for planning problems represented as constraint satisfaction or satisfiability problems. The standard evaluation strategy, ...