Sciweavers

977 search results - page 86 / 196
» Logic programming with infinite sets
Sort
View
96
Voted
SAS
2007
Springer
128views Formal Methods» more  SAS 2007»
15 years 6 months ago
Magic-Sets Transformation for the Analysis of Java Bytecode
Denotational static analysis of Java bytecode has a nice and clean compositional definition and an efficient implementation with binary decision diagrams. But it models only the f...
Étienne Payet, Fausto Spoto
94
Voted
ATAL
2010
Springer
15 years 1 months ago
Reasoning about strategies of multi-agent programs
Verification of multi-agent programs is a key problem in agent research and development. This paper focuses on multi-agent programs that consist of a finite set of BDI-based agent...
Mehdi Dastani, Wojciech Jamroga
JELIA
2000
Springer
15 years 4 months ago
A Logic for Modeling Decision Making with Dynamic Preferences
We present a framework for decision making with the possibility to express circumstance-dependent preferences among different alternatives for a decision. This new formalism, Order...
Marina De Vos, Dirk Vermeir
91
Voted
LICS
2007
IEEE
15 years 6 months ago
A Dependent Set Theory
Set theories are traditionally based on first-order logic. We show that in a constructive setting, basing a set theory on a dependent logic yields many benefits. To this end, we...
Wojciech Moczydlowski
107
Voted
IFL
2004
Springer
15 years 6 months ago
A Virtual Machine for Functional Logic Computations
Abstract. We describe the architecture of a virtual machine for executing functional logic programming languages. A distinguishing feature of our machine is that it preserves the o...
Sergio Antoy, Michael Hanus, Jimeng Liu, Andrew P....