241 search results - page 13 / 49 » Bounded Nondeterminism of Logic Programs |
LPNMR
2001
Springer
14 years 2 days ago
2001
Springer
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...
CEFP
2005
Springer
14 years 1 months ago
2005
Springer
This chapter describes Hume: a functionally-based language for programming with bounded resource usage, including time and space properties. The purpose of the Hume language design...
CORR
2002
Springer
13 years 7 months ago
2002
Springer
Abstract. We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than t...
PPDP
2001
Springer
14 years 2 days ago
2001
Springer
This paper explores the question of when two propagationbased constraint systems have the same behaviour, in terms of search space. We categorise the behaviour of domain and bound...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
State of the art analyzers in the Logic Programming (LP) paradigm are nowadays mature and sophisticated. They allow inferring a wide variety of global properties including terminat...