Sciweavers

740 search results - page 63 / 148
» Open Answer Set Programming with Guarded Programs
Sort
View
CORR
2004
Springer
124views Education» more  CORR 2004»
13 years 9 months ago
On the existence of stable models of non-stratified logic programs
In this paper we analyze the relationship between cyclic definitions and consistency in GelfondLifschitz's answer sets semantics (initially defined as `stable model semantics...
Stefania Costantini
ENTCS
2002
148views more  ENTCS 2002»
13 years 9 months ago
A Declarative Debugging System for Lazy Functional Logic Programs
We present a declarative debugger for lazy functional logic programs with polymorphic type discipline. Whenever a computed answer is considered wrong by the user (error symptom), ...
Rafael Caballero, Mario Rodríguez-Artalejo
ICLP
2005
Springer
14 years 2 months ago
A Comparison of CLP(FD) and ASP Solutions to NP-Complete Problems
This paper presents experimental comparisons between declarative encodings of various computationally hard problems in both Answer Set Programming (ASP) and Constraint Logic Progra...
Agostino Dovier, Andrea Formisano, Enrico Pontelli
ACE
2003
104views Education» more  ACE 2003»
13 years 10 months ago
Language Tug-Of-War: Industry Demand and Academic Choice
This paper seeks to inform instructors responsible for designing introductory programming courses within a university setting. In particular, guidelines for choosing programming l...
Michael de Raadt, Richard Watson, Mark A. Toleman
AICOM
2006
129views more  AICOM 2006»
13 years 9 months ago
A backjumping technique for Disjunctive Logic Programming
In this work we present a backjumping technique for Disjunctive Logic Programming (DLP) under the Answer Set Semantics. It builds upon related techniques that had originally been p...
Francesco Ricca, Wolfgang Faber, Nicola Leone