Sciweavers

175 search results - page 9 / 35
» Generalizing stable semantics by preferences
Sort
View
ICLP
2010
Springer
15 years 7 months ago
HEX Programs with Action Atoms
hex programs were originally introduced as a general framework for extending declarative logic programming, under the stable model semantics, with the possibility of bidirectional...
Selen Basol, Ozan Erdem, Michael Fink, Giovambatti...
148
Voted
ASP
2003
Springer
15 years 8 months ago
Eliminating Disjunction from Propositional Logic Programs under Stable Model Preservation
Abstract. In general, disjunction is considered to add expressive power to propositional logic programs under stable model semantics, and to enlarge the range of problems which can...
Thomas Eiter, Michael Fink, Hans Tompits, Stefan W...
136
Voted
SIAMDM
2010
99views more  SIAMDM 2010»
14 years 10 months ago
On the Stable Paths Problem
The Border Gateway Protocol (BGP) is the interdomain routing protocol used to exchange routing information between Autonomous Systems (ASes) in the internet today. While intradoma...
Penny E. Haxell, Gordon T. Wilfong
163
Voted
CORR
2004
Springer
124views Education» more  CORR 2004»
15 years 3 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
157
Voted
ECAI
2010
Springer
15 years 2 months ago
Local search algorithms on the Stable Marriage Problem: Experimental Studies
The stable marriage problem (SM) has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more general...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...