1401 search results - page 13 / 281 » Tool Integration for Reasoned Programming |
PPDP
1999
Springer
13 years 11 months ago
1999
Springer
We present a slicing approach for analyzing logic programs with respect to non-termination. The notion of a failure-slice is presented which is an executable reduced fragment of th...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
This paper presents a toolkit for spreadsheet visualization based on logical areas, semantic classes and data Logical areas, semantic classes and data modules are abstract represe...
RULEML
2004
Springer
14 years 27 days ago
2004
Springer
Abstract. We extend Answer Set Programming with, possibly infinite, open domains. Since this leads, in general, to undecidable reasoning, we restrict the syntax of programs, while...
FLAIRS
2007
13 years 10 months ago
2007
This work addresses the issue of prioritized reasoning in the context of logic programming. The case of preference conditions involving atoms is considered and a refinement of th...
IFL
2005
Springer
14 years 1 months ago
2005
Springer
In programs written in lazy functional languages such as for example Clean and Haskell, the programmer can choose freely whether particular subexpressions will be evaluated lazily ...