![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
4. NMELP 1994: Santa Margherita Ligure, Italy
- Jürgen Dix, Luís Moniz Pereira, Teodor C. Przymusinski:
Non-Monotonic Extensions of Logic Programming (NMELP'94), ICLP '94 Workshop, Santa Margherita Ligure, Italy, June 17, 1994, Selected Papers. Lecture Notes in Computer Science 927, Springer 1995, ISBN 3-540-59467-1
Semantics
- José Júlio Alferes
, Luís Moniz Pereira:
An Argumentation Theoretic Semantics Based on Non-Refutable Falsity. 3-22 - Vladimir Lifschitz, Hudson Turner:
From Disjunctive Programs to Abduction. 23-42 - Teodor C. Przymusinski:
Semantics of Normal and Disjunctive Logic Programs: A Unifying Framework. 43-67 - Cees Witteveen:
Every Normal Program has a Nearly-Stable Model. 68-84 - Jia-Huai You, Li-Yan Yuan:
Logic Programming with Assumption Denials. 85-100
Computation
- Monica D. Barback, Jorge Lobo
:
A Resolution-based Procedure for Default Theories with Extensions. 101-126 - Stefan Brass, Jürgen Dix:
A general Approach to Bottom-Up Computation of Disjunctive Semantics. 127-155 - Stefania Costantini, Gaetano Aurelio Lanzarone:
Static Semantics as Program Transformation and Well-founded Computation. 156-180 - Lars Degerstedt, Ulf Nilsson:
Magic Computation for Wll-founded Semantics. 181-204 - Carolina Ruiz, Jack Minker:
Computing Stable and Partial Stable Models of Extended Disjunctive Logic Programs. 205-229
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.