50 search results - page 6 / 10 » On Bounded Rational Trace Languages |
174
Voted
LPAR
2001
Springer
15 years 10 months ago
2001
Springer
Several logic-based languages, such as Prolog II and its successors, SICStus Prolog and Oz, offer a computation domain including rational trees. Infinite rational trees allow fo...
143
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. We extend the basic system relations of trace inclusion, trace equivalence, simulation, and bisimulation to a quantitative setting in which propositions are interpreted n...
186
click to vote
ATVA
2007
Springer
15 years 11 months ago
2007
Springer
This paper presents a bounded model checking algorithm for the verification of analog and mixed-signal (AMS) circuits using a satisfiability modulo theories (SMT) solver. The sys...
276
click to vote
POPL
2009
ACM
16 years 6 months ago
2009
ACM
Self-adjusting computation is an evaluation model in which programs can respond efficiently to small changes to their input data by using a change-propagation mechanism that updat...
171
Voted
JAIR
2008
15 years 5 months ago
2008
This paper presents Networks of Influence Diagrams (NID), a compact, natural and highly expressive language for reasoning about agents' beliefs and decision-making processes....