Sciweavers

395 search results - page 30 / 79
» Decision Problems for Convex Languages
Sort
View
IJCAI
2003
13 years 9 months ago
Scenario-based Stochastic Constraint Programming
To model combinatorial decision problems involving uncertainty and probability, we extend the stochastic constraint programming framework proposed in [Walsh, 2002] along a number ...
Suresh Manandhar, Armagan Tarim, Toby Walsh
DLOG
2009
13 years 5 months ago
Relativizing Concept Descriptions to Comparison Classes
Context-sensitivity has been for long a subject of study in linguistics, logic and computer science. Recently the problem of representing and reasoning with contextual knowledge ha...
Szymon Klarman, Stefan Schlobach
OOPSLA
1998
Springer
13 years 11 months ago
Data Groups: Specifying the Modification of Extended State
This paper explores the interpretation of specifications in the context of an object-oriented programming language with subclassing and method overrides. In particular, the paper ...
K. Rustan M. Leino
TPHOL
2000
IEEE
13 years 11 months ago
Equational Reasoning via Partial Reflection
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
PLDI
2004
ACM
14 years 1 months ago
Jedd: a BDD-based relational extension of Java
In this paper we present Jedd, a language extension to Java that supports a convenient way of programming with Binary Decision Diagrams (BDDs). The Jedd language abstracts BDDs as...
Ondrej Lhoták, Laurie J. Hendren