Sciweavers

1711 search results - page 223 / 343
» Completing pseudojump operators
Sort
View
CORR
2006
Springer
90views Education» more  CORR 2006»
13 years 9 months ago
The recognizability of sets of graphs is a robust property
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
Bruno Courcelle, Pascal Weil
JOLLI
2008
145views more  JOLLI 2008»
13 years 9 months ago
Temporal Languages for Epistemic Programs
This paper adds temporal logic to public announcement logic (PAL) and dynamic epistemic logic (DEL). By adding a previous-time operator to PAL, we express in the language statemen...
Joshua Sack
KES
2008
Springer
13 years 9 months ago
Functional genetic programming and exhaustive program search with combinator expressions
Using a strongly typed functional programming language for genetic programming has many advantages, but evolving functional programs with variables requires complex genetic operat...
Forrest Briggs, Melissa O'Neill
ENTCS
2007
128views more  ENTCS 2007»
13 years 9 months ago
Optimisation Validation
We introduce the idea of optimisation validation, which is to formally establish that an instance of an optimising transformation indeed improves with respect to some resource mea...
David Aspinall, Lennart Beringer, Alberto Momiglia...
LPNMR
1997
Springer
14 years 1 months ago
Power Defaults
This paper introduces power default reasoning (PDR), a framework for nonmonotonic reasoning based on the domain-theoretic idea of modeling default rules with partial-information i...
Guo-Qiang Zhang, William C. Rounds