32 search results - page 4 / 7 » New Algebraic Tools for Constraint Satisfaction |
CPAIOR
2004
Springer
13 years 11 months ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
SARA
2007
Springer
14 years 1 months ago
2007
Springer
Though there exist some rules of thumb for design of good models for solving constraint satisfaction problems, the modeling process still belongs more to art than to science. Moreo...
IPPS
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. In the last decades, the Satisfiability and Constraint Satisfaction Problem frameworks were extended to integrate aspects such as uncertainties, partial observabilities, ...
IEAAIE
2001
Springer
14 years 5 days ago
2001
Springer
Abstract. This paper presents AROM, a new object-based knowledge representation system. AROM is original in two ways. Firstly, in addition to classes, knowledge representation in A...