Sciweavers

413 search results - page 19 / 83
» On Product Logic with Truth-constants
Sort
View
POPL
1994
ACM
15 years 3 months ago
Combinations of Abstract Domains for Logic Programming
ions of abstract domains for logic programming: open product and generic pattern construction Agostino Cortesia; , Baudouin Le Charlierb , Pascal Van Hentenryckc aDipartimento di I...
Agostino Cortesi, Baudouin Le Charlier, Pascal Van...
FLAIRS
2004
15 years 1 months ago
Product-based Causal Networks and Quantitative Possibilistic Bases
In possibility theory, there are two kinds of possibilistic causal networks depending if possibilistic conditioning is based on the minimum or on the product operator. Similarly t...
Salem Benferhat, Faiza Khellaf, Aïcha Mokhtar...
FSTTCS
2010
Springer
14 years 9 months ago
First-Order Logic with Reachability Predicates on Infinite Systems
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
Stefan Schulz
EUSFLAT
2009
135views Fuzzy Logic» more  EUSFLAT 2009»
14 years 9 months ago
Exchanging Iterated Expectations of Random Upper Semicontinuous Functions: an application to decision theory
In this paper we present a procedure to deal with a kind of single-stage decision problems with imprecise utilities. In this type of problems the product measurability of the utili...
Miguel López-Díaz, Luis J. Rodr&iacu...
ASIAN
2003
Springer
170views Algorithms» more  ASIAN 2003»
15 years 5 months ago
Model Checking Probabilistic Distributed Systems
Protocols for distributed systems make often use of random transitions to achieve a common goal. A popular example are randomized leader election protocols. We introduce probabilis...
Benedikt Bollig, Martin Leucker