Sciweavers

330 search results - page 16 / 66
» Algorithms for Propositional Model Counting
Sort
View
FSTTCS
2009
Springer
15 years 4 months ago
Modelchecking counting properties of 1-safe nets with buffers in paraPSPACE
ABSTRACT. We consider concurrent systems that can be modelled as 1-safe Petri nets communicating through a fixed set of buffers (modelled as unbounded places). We identify a param...
M. Praveen, Kamal Lodaya
SYNASC
2006
IEEE
64views Algorithms» more  SYNASC 2006»
15 years 3 months ago
Scheme-Based Systematic Exploration of Natural Numbers
In this paper, we report a case study of computer supported exploration of the theory of natural numbers, using a theory exploration model based on knowledge schemes, proposed by ...
Madalina Hodorog, Adrian Craciun
83
Voted
UAI
1993
14 years 10 months ago
Probabilistic Assumption-Based Reasoning
In this paper the classical propositional assumption-based model is extended to incorporate probabilities for the assumptions. Then the whole model is placed into the framework of...
Jürg Kohlas, Paul-André Monney
CIKM
2008
Springer
14 years 11 months ago
Linear time membership in a class of regular expressions with interleaving and counting
The extension of Regular Expressions (REs) with an interleaving (shuffle) operator has been proposed in many occasions, since it would be crucial to deal with unordered data. Howe...
Giorgio Ghelli, Dario Colazzo, Carlo Sartiani
DAC
2005
ACM
15 years 10 months ago
Net weighting to reduce repeater counts during placement
We demonstrate how to use placement to ameliorate the predicted repeater explosion problem caused by poor interconnect scaling. We achieve repeater count reduction by dynamically ...
Brent Goplen, Prashant Saxena, Sachin S. Sapatneka...