Sciweavers

580 search results - page 79 / 116
» On the Foundations of Answer Set Programming
Sort
View
AI
2010
Springer
13 years 8 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
STOC
2006
ACM
134views Algorithms» more  STOC 2006»
14 years 9 months ago
Byzantine agreement in the full-information model in O(log n) rounds
We present a randomized Byzantine Agreement (BA) protocol with an expected running time of O(log n) rounds, in a synchronous full-information network of n players. For any constan...
Michael Ben-Or, Elan Pavlov, Vinod Vaikuntanathan
KESAMSTA
2007
Springer
14 years 2 months ago
Ontology Agent Based Rule Base Fuzzy Cognitive Maps
This work proposes a framework for the design and development of Ontology Agents oriented to manage Rule Base Fuzzy Cognitive Maps (RBFCM). The approach takes into account the foun...
Alejandro Peña Ayala, Humberto Sossa, Franc...
LPNMR
2001
Springer
14 years 1 months ago
Bounded LTL Model Checking with Stable Models
In this paper bounded model checking of asynchronous concurrent systems is introduced as a promising application area for answer set programming. As the model of asynchronous syst...
Keijo Heljanko, Ilkka Niemelä
ICTAI
2008
IEEE
14 years 3 months ago
The System BioC for Reasoning about Biological Models in Action Language C
We elaborate upon the usage of action language C for representing and reasoning about biological models. First, we provide a simple extension of C allowing for variables and show ...
Steve Dworschak, Torsten Grote, Arne König, T...