Sciweavers

138 search results - page 4 / 28
» Planning with Preferences Using Logic Programming
Sort
View
ICLP
2001
Springer
13 years 12 months ago
Alternating Fixed Points in Boolean Equation Systems as Preferred Stable Models
We formally characterize alternating fixed points of boolean equation systems as models of (propositional) normal logic programs. To this end, we introduce the notion of a preferr...
K. Narayan Kumar, C. R. Ramakrishnan, Scott A. Smo...
KR
1994
Springer
13 years 11 months ago
REVISE: An Extended Logic Programming System for Revising Knowledge Bases
In this paper we describe REVISE, an extended logic programming system for revising knowledge bases. REVISE is based on logic programming with explicit negation, plus a two-valued...
Carlos Viegas Damásio, Wolfgang Nejdl, Lu&i...
KR
2004
Springer
14 years 23 days ago
Complex Preferences for Answer Set Optimization
The main contribution of this paper is the definition of the preference description language  ¡¢ . This language allows us to combine qualitative and quantitative, penalty bas...
Gerhard Brewka
DEXA
2004
Springer
131views Database» more  DEXA 2004»
14 years 24 days ago
Partially Ordered Preferences Applied to the Site Location Problem in Urban Planning
Abstract. This paper presents an application that aims at identifying optimal locations based on partially ordered constraints. It combines a tool developed in this project that al...
Sylvain Lagrue, Rodolphe Devillers, Jean-Yves Besq...
IIE
2007
75views more  IIE 2007»
13 years 7 months ago
Program and Evaluation Planning Light: Planning in the Real World
Although there are many high-quality models for program and evaluation planning, these models are often too intensive to be used in situations when time and resources are scarce. A...
Justus J. Randolph, Pasi J. Eronen