Programs with Stable Model Semantics
Download:
|
|
by Tommi Syrj Anen, Tommi Syrj Anen
http://www.tcs.hut.fi/Publications/bibdb/HUT-TCS-B18.ps.gz
Add To MetaCart
Abstract:
Abstract: The aim of this work is to dene a new class of logic programs, strongly range restricted logic programs, and to design and implement an ecient algorithm for grounding them locally. A grounding transforms a function-free logic program into an equivalent ground logic program. A grounding is local if can be done one rule at a time. The implementation works with smodels, an implementation for stable model semantics for normal
Citations
| 639 | The Semantics of Predicate Logic as a Programming Language – Emden, Kowalski - 1976 |
| 409 | Semantical considerations on nonmonotonic logic – Moore - 1985 |
| 372 | Algorithms in C – Sedgewick - 1990 |
| 203 | Logic programs with stable model semantics as a constraint programming paradigm – Niemela - 1999 |
| 197 | Tabled Evaluation with Delaying for General Logic Programs – Chen, Warren - 1996 |
| 145 | Efficient implementation of the well-founded and stable model semantics – Niemela, Simons - 1996 |
| 107 | The KR System dlv: Progress Report, Comparisons and Benchmarks – Eiter, Leone, et al. - 1998 |
| 37 | An abstract machine for computing the well-founded semantics – Sagonas, Swift, et al. - 1996 |
| 34 | The Stanford GraphBase – Knuth - 1993 |
| 30 | Towards constraint satisfaction through logic programs and the stable model semantics – Simons - 1997 |
| 9 | Towards ecient default reasoning – Niemela - 1995 |
