293 search results - page 1 / 59 » Computing Stable Models by Using the ATMS |
AAAI
1990
13 years 5 months ago
1990
An algorithm is described which computes stable models of propositional logic programs with negation as failure using the Assumption Based Truth Maintenance mechanism. Since stabl...
RTSS
1997
IEEE
13 years 8 months ago
1997
IEEE
Static-priority scheduling is popular for traffic scheduling in ATM switches because it is less costly than dynamic priority scheduling while being sensitive to the delay constra...
ASP
2005
Springer
13 years 10 months ago
2005
Springer
Possibilistic Stable model Semantics is an extension of Stable Model Semantics that allows to merge uncertain and non monotonic reasoning into a unique framework. To achieve this a...
ICNP
1997
IEEE
13 years 8 months ago
1997
IEEE
The e cient support of data tra c over ATM networks requires congestion control, whose objectives include maximizing throughput, minimizing switch bu er requirement, and attaining...
LPNMR
2005
Springer
13 years 9 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, ...