Sciweavers

2386 search results - page 281 / 478
» Representing and Reasoning with Preferences
Sort
View
LICS
1998
IEEE
15 years 10 months ago
Compositional Analysis of Expected Delays in Networks of Probabilistic I/O Automata
Probabilistic I/O automata (PIOA) constitute a model for distributed or concurrent systems that incorporates a notion of probabilistic choice. The PIOA model provides a notion of ...
Eugene W. Stark, Scott A. Smolka
ILP
2000
Springer
15 years 10 months ago
Bayesian Logic Programs
First-order probabilistic models are recognized as efficient frameworks to represent several realworld problems: they combine the expressive power of first-order logic, which serv...
Kristian Kersting, Luc De Raedt
ICCBR
1995
Springer
15 years 10 months ago
On the use of CBR in optimisation problems such as the TSP
The particular strength of CBR is normally considered to be its use in weak theory domains where solution quality is compiled into cases and is reusable. In this paper we explore a...
Padraig Cunningham, Barry Smyth, Neil J. Hurley
LICS
1997
IEEE
15 years 10 months ago
How Much Memory is Needed to Win Infinite Games?
We consider a class of infinite two-player games on finitely coloured graphs. Our main question is: given a winning condition, what is the inherent blow-up (additional memory) of ...
Stefan Dziembowski, Marcin Jurdzinski, Igor Waluki...
ICLP
1991
Springer
15 years 10 months ago
{log}: A Logic Programming Language with Finite Sets
An extended logic programming language embodying sets is developed in successive stages, introducing at each stage simple set dictions and operations, and discussing their operati...
Agostino Dovier, Eugenio G. Omodeo, Enrico Pontell...