Extending the Stable Model Semantics with More Expressive Rules
| dc.creator | Simons, Patrik | |
| dc.date | 1999-08-06 | |
| dc.date.accessioned | 2026-07-07T03:24:17Z | |
| dc.date.available | 2026-07-07T03:24:17Z | |
| dc.description | The rules associated with propositional logic programs and the stable model semantics are not expressive enough to let one write concise programs. This problem is alleviated by introducing some new types of propositional rules. Together with a decision procedure that has been used as a base for an efficient implementation, the new rules supplant the standard ones in practical applications of the stable model semantics. | |
| dc.description | 18 pages, a shortened version will be published in the proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR'99) | |
| dc.identifier | https://arxiv.org/abs/cs/9908004 | |
| dc.identifier | http://arxiv.org/abs/cs/9908004 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33268 | |
| dc.subject | Logic in Computer Science | |
| dc.subject | Artificial Intelligence | |
| dc.subject | I.2.3; I.2.8; F.4.1 | |
| dc.title | Extending the Stable Model Semantics with More Expressive Rules | |
| dc.type | text |