46 search results - page 4 / 10 » Combinatorial Problems for Horn Clauses |
CPAIOR
2010
Springer
13 years 5 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
CADE
2006
Springer
14 years 7 months ago
2006
Springer
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
DOOD
1991
Springer
13 years 11 months ago
1991
Springer
This paper examines the problem of adding non-deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the...
CCS
2010
ACM
13 years 4 months ago
2010
ACM
We address the insecurity problem for cryptographic protocols, for an active intruder and a bounded number of sessions. The protocol steps are modeled as rigid Horn clauses, and t...
PLILP
1998
Springer
13 years 11 months ago
1998
Springer
: The bene ts of the object, logic or relational, functional, and constraint paradigms can be obtained from our previous combination of the object and functional paradigms in hidde...