Sciweavers

158 search results - page 22 / 32
» LPForget: A System of Forgetting in Answer Set Programming
Sort
View
LPNMR
2001
Springer
13 years 12 months ago
Bounded LTL Model Checking with Stable Models
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...
Keijo Heljanko, Ilkka Niemelä
IJKSR
2011
106views more  IJKSR 2011»
12 years 11 months ago
Integrating the LMS in Service Oriented eLearning Systems
Learning management systems are routinely used for presenting, solving and grading exercises with large classes. However, teachers are constrained to use questions with pre-defined...
José Paulo Leal, Ricardo Queirós
VLDB
2002
ACM
122views Database» more  VLDB 2002»
13 years 7 months ago
Lightweight Flexible Isolation for Language-based Extensible Systems
Safe programming languages encourage the development of dynamically extensible systems, such as extensible Web servers and mobile agent platforms. Although protection is of utmost...
Laurent Daynès, Grzegorz Czajkowski
UM
2001
Springer
13 years 12 months ago
Utility-Based Decision Tree Optimization: A Framework for Adaptive Interviewing
Abstract: An emerging practice in e-commerce systems is to conduct interviews with buyers in order to identify their needs. The goal of such an interview is to determine sets of pr...
Markus Stolze, Michael Ströbel
CORR
2004
Springer
124views Education» more  CORR 2004»
13 years 7 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