| Автор | LAENENS, E. |
| Автор | VERMEIR, D. |
| Дата выпуска | 1990 |
| dc.description | We develop semantics for a logic, called ordered logic (OL), which models the most important aspects of object-oriented programming languages, such as object identity, multiple inheritance and defaults. The logic is based on a partially ordered structure of logical theories, which play the role of objects. OL is non-monotonic under the natural modeltheoretic semantics.A non-deterministic procedure is defined that has all models as fixpoints. It is shown that, for a well-behaved subclass of theories, this procedure can be used to generate exactly the set of ‘preferred’ models, where preference is based on the lack of ‘assumptions’.Classical logic programs with negation by failure are special cases of OL theories. From the above we can then derive a syntactic characterization of logic programs with stable models. |
| Формат | application.pdf |
| Издатель | Oxford University Press |
| Копирайт | © Oxford University Press |
| Тема | Original Articles |
| Название | A Fixpoint Semantics for Ordered Logic |
| Тип | research-article |
| Electronic ISSN | 1465-363X |
| Print ISSN | 0955-792X |
| Журнал | Journal of Logic and Computation |
| Том | 1 |
| Первая страница | 159 |
| Последняя страница | 185 |
| Аффилиация | LAENENS E.; Philips Applications and Software Services, Advanced Information Technology, Building HCM5 |
| Аффилиация | VERMEIR D.; Department of Mathematics and Computer Science, University of Antwerp, UIA, Universiteitsplein 1 |
| Выпуск | 2 |
