Sciweavers

756 search results - page 149 / 152
» Using Logic Programs to Reason about Infinite Sets
Sort
View
AAAI
1998
13 years 8 months ago
Learning Investment Functions for Controlling the Utility of Control Knowledge
The utility problem occurs when the cost of the acquired knowledge outweighs its bene ts. When the learner acquires control knowledge for speeding up a problem solver, the bene t ...
Oleg Ledeniov, Shaul Markovitch
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 7 months ago
Binding bigraphs as symmetric monoidal closed theories
Milner's bigraphs [1] are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the -calcul...
Tom Hirschowitz, Aurélien Pardon
SCP
2010
155views more  SCP 2010»
13 years 5 months ago
Type inference and strong static type checking for Promela
The SPIN model checker and its specification language Promela have been used extensively in industry and academia to check logical properties of distributed algorithms and protoc...
Alastair F. Donaldson, Simon J. Gay
CP
2004
Springer
14 years 22 days ago
Controllability of Soft Temporal Constraint Problems
In real-life temporal scenarios, uncertainty and preferences are often essential, coexisting aspects. We present a formalism where temporal constraints with both preferences and un...
Francesca Rossi, Kristen Brent Venable, Neil Yorke...
CAV
2008
Springer
139views Hardware» more  CAV 2008»
13 years 9 months ago
CSIsat: Interpolation for LA+EUF
We present CSIsat, an interpolating decision procedure for the quantifier-free theory of rational linear arithmetic and equality with uninterpreted function symbols. Our implementa...
Dirk Beyer, Damien Zufferey, Rupak Majumdar