Rijke. Towards Feature Interaction via Stable Models (1999) [2 citations — 0 self]
Download:
|
|
by Rafael Accorsi, Carlos Areces, Maarten Rijke
In Proceedings of the 2nd WFM
http://www.informatik.uni-freiburg.de/~accorsi/articles/WFM99_Final.ps.gz
Add To MetaCart
Abstract:
Abstract. In this paper we propose a new approach to the problem of detecting feature interactions based on the stable models semantics for logical programs. Starting from a formal denition of a model of the Basic Call System, we encode the allowed actions and transitions by means of rules in the style of Reiter's defaults. We can then use tools like smodels to perform tasks like verication and testing.
Citations
| 1177 | A logic for default reasoning – Reiter - 1979 |
| 189 | Logic programs with stable model semantics as a constraint programming paradigm – Niemela - 1999 |
| 182 | Autoepistemic logic – Marek, Truszczynski - 1991 |
| 163 | Decidable reasoning in terminological knowledge representation systems – Buchheit, Donini, et al. - 1993 |
| 141 | Efficient implementation of the well-founded and stable model semantics – Niemela, Simons - 1996 |
| 50 | On the declarative semantics of logic programs with negation – Lifschitz - 1988 |
| 14 | Rijke. Description logics and feature interaction – Areces, Bouma, et al. - 1999 |
| 7 | switching systems generic requirements (LSSGR – LATA - 1992 |
