3775 search results - page 222 / 755 » The Expression Problem Revisited |
148
Voted
ACTA
2007
15 years 5 months ago
2007
Abstract. In order to design and analyse complex systems, modelers need formal models with two contradictory requirements: a high expressivity and the decidability of behavioural p...
130
Voted
JCT
2007
15 years 4 months ago
2007
We prove that one can express the vertex-minor relation on finite undirected graphs by formulas of monadic second-order logic (with no edge set quantification) extended with a p...
152
Voted
CP
2005
Springer
15 years 10 months ago
2005
Springer
Many problems in chemistry, robotics or molecular biology can be expressed as a Distance CSP4 . In this paper, we propose a specific methodology for tackling uncertainties in this...
129
click to vote
LPNMR
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. We present a declarative language, PP, for the specification of preferences between possible solutions (or trajectories) of a planning problem. This novel language allow...
136
click to vote
RTA
2004
Springer
15 years 10 months ago
2004
Springer
The problem of selecting nodes in unranked trees is the most basic querying problem for XML. We propose stepwise tree automata for querying unranked trees. Stepwise tree automata c...