5 search results - page 1 / 1 » Merging Qualitative Constraint Networks Defined on Different... |
COSIT
2009
Springer
13 years 9 months ago
2009
Springer
Abstract. This paper addresses the problem of merging qualitative constraint networks (QCNs) defined on different qualitative formalisms. Our model is restricted to formalisms wher...
ICTAI
2009
IEEE
13 years 2 months ago
2009
IEEE
We address the problem of merging qualitative constraints networks (QCNs). We point out a merging algorithm which computes a consistent QCN representing a global view of the input...
LPAR
2010
Springer
13 years 3 months ago
2010
Springer
We address the problem of merging qualitative constraint networks (QCNs) representing agents local preferences or beliefs on the relative position of spatial or temporal entities. ...
CONSTRAINTS
2010
13 years 2 months ago
2010
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
ECAI
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. Interval temporal logics formalize reasoning about interval structures over (usually) linearly ordered domains, where time intervals are the primitive ontological entitie...