Sciweavers

1941 search results - page 281 / 389
» Reasoning about Computations Using Two-Levels of Logic
Sort
View
AAAI
2004
15 years 5 months ago
Towards Efficient Sampling: Exploiting Random Walk Strategies
From a computational perspective, there is a close connection between various probabilistic reasoning tasks and the problem of counting or sampling satisfying assignments of a pro...
Wei Wei, Jordan Erenrich, Bart Selman
160
Voted
AMAI
2006
Springer
15 years 3 months ago
Possibilistic uncertainty handling for answer set programming
In this work, we introduce a new framework able to deal with a reasoning that is at the same time non monotonic and uncertain. In order to take into account a certainty level assoc...
Pascal Nicolas, Laurent Garcia, Igor Stépha...
129
Voted
NGC
2006
Springer
102views Communications» more  NGC 2006»
15 years 3 months ago
Evaluation of Automatic Generation of Basic Stories
Abstract This paper presents an application that automatically generates basic stories: short texts that only narrate the main events of the plot. The system operates with a repres...
Federico Peinado, Pablo Gervás
137
Voted
CORR
2008
Springer
148views Education» more  CORR 2008»
15 years 2 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel
107
Voted
CORR
2010
Springer
84views Education» more  CORR 2010»
15 years 1 months ago
Rewriting and Well-Definedness within a Proof System
Term rewriting has a significant presence in various areas, not least in automated theorem proving where it is used as a proof technique. Many theorem provers employ specialised p...
Issam Maamria, Michael Butler