4513 search results - page 330 / 903 » Logic programming with satisfiability |
134
click to vote
FOSSACS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicati...
122
Voted
CIE
2007
Springer
15 years 10 months ago
2007
Springer
Realizability theory is not just a fundamental tool in logic and computability. It also has direct application to the design and implementation of programs, since it can produce co...
116
Voted
SE
2008
15 years 6 months ago
2008
: In many of today's application programs, security functionality is inseparably intertwined with the actual mission-purpose logic. As a result, the trusted code base is unnec...
131
click to vote
PPDP
2010
Springer
15 years 2 months ago
2010
Springer
The Constraint Simplification Rules (CSR) subset of CHR and the flat subset of LCC, where agent nesting is restricted, are very close syntactically and semantically. The first con...
190
click to vote
GECCO
2011
Springer
14 years 8 months ago
2011
Springer
—A number of representation schemes have been presented for use within Learning Classifier Systems, ranging from binary encodings to Neural Networks, and more recently Dynamical ...