Sciweavers

85 search results - page 4 / 17
» Reimagining literate programming
Sort
View
LPNMR
2005
Springer
14 years 2 days ago
Approximating Answer Sets of Unitary Lifschitz-Woo Programs
We investigate techniques for approximating answer sets of general logic programs of Lifschitz and Woo, whose rules have single literals as heads. We propose three different method...
Victor W. Marek, Inna Pivkina, Miroslaw Truszczyns...
IWPC
2000
IEEE
13 years 11 months ago
Requirements for an Elucidative Programming Environment
The main goal with this paper is to motivate and coin a variation of literate programming which we call elucidative programming. Elucidative programming is oriented towards progra...
Kurt Nørmark
ICLP
1998
Springer
13 years 10 months ago
Iterated Logic Program Updates
The eld of theory update has seen some improvement, in what regards updating, by allowing desired updates to be speci ed by update programs. The updating of models is governed by ...
João Alexandre Leite, Luís Moniz Per...
LPKR
1997
Springer
13 years 10 months ago
Abduction, Argumentation and Bi-Disjunctive Logic Programs
Abstract. We study the relationship between argumentation (abduction) and disjunctive logic programming. Based on the paradigm of argumentation, an abductive semantic framework for...
Kewen Wang, Huowang Chen
CORR
2004
Springer
140views Education» more  CORR 2004»
13 years 6 months ago
Checking modes of HAL programs
Recent constraint logic programming (CLP) languages, such as HAL and Mercury, require type, mode and determinism declarations for predicates. This information allows the generatio...
Maria J. García de la Banda, Warwick Harvey...