Sciweavers

3738 search results - page 144 / 748
» Parametrized Logic Programming
Sort
View
ICLP
2004
Springer
14 years 1 months ago
Termination of Logic Programs Using Various Dynamic Selection Rules
Abstract. We study termination of logic programs with dynamic scheduling, as it can be realised using delay declarations. Following previous work, our minimum assumption is that de...
Jan-Georg Smaus
ATS
2009
IEEE
127views Hardware» more  ATS 2009»
14 years 1 months ago
On the Generation of Functional Test Programs for the Cache Replacement Logic
Caches are crucial components in modern processors (both stand-alone or integrated into SoCs) and their test is a challenging task, especially when addressing complex and high-fre...
Wilson J. Perez, Danilo Ravotto, Edgar E. Sá...
ECAI
2006
Springer
13 years 12 months ago
Logic Programs with Multiple Chances
Abstract. In human-like reasoning it often happens that different conditions, partially alternative and hierarchically structured, are mentally grouped in order to derive some conc...
Francesco Buccafurri, Gianluca Caminiti, Domenico ...
AI
2001
Springer
13 years 11 months ago
Stratified Partial-Order Logic Programming
The stable semantics has become a prime candidate for knowledge representation and reasoning. The rules associated with propositional logic programs and the stable semantics are no...
Mauricio Osorio, Juan Carlos Nieves
ICLP
2001
Springer
14 years 18 days ago
Fixed-Parameter Complexity of Semantics for Logic Programs
In the paper we establish the xed-parameter complexity for several parameterized decision problems involving models, supported models and stable models of logic programs. We also e...
Zbigniew Lonc, Miroslaw Truszczynski