10871 search results - page 16 / 2175 » A stable programming language |
284
Voted
POPL
2001
ACM
15 years 12 months ago
2001
ACM
LPNMR
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We describe a new software, pbmodels, that uses pseudo-boolean constraint solvers (PB solvers) to compute stable models of logic programs with weight atoms. To this end, ...
103
Voted
POS
1994
Springer
15 years 3 months ago
1994
Springer
Persistent stores support uniform management of data objects regardless of their lifetimes and locations. Such stores typically maintain a self-consistent state even after failure...
111
Voted
ASP
2001
Springer
15 years 4 months ago
2001
Springer
Answer-set programming (ASP) solvers must handle difficult computational problems that are NP-hard. These solvers are in the worst case exponential and their scope of applicabilit...
77
Voted
WLP
2005
Springer
15 years 5 months ago
2005
Springer
Assigning semantics to logic programs via selector generated models (Schwarz 2002/2003) extends several semantics, like the stable, the inflationary, and the stable generated sema...