![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Fundamenta Informaticae, Volume 28
Volume 28, Numbers 1-2, November 1996
- José Júlio Alferes, Luís Moniz Pereira, Teodor C. Przymusinski:
Belief Revision in Non-Monotonic Reasoning and Logic Programming. 1-22 - Krzysztof R. Apt, Rachel Ben-Eliyahu:
Meta-Variables in Logic Programming, or in Praise of Ambivalent Syntax. 23-36 - Howard A. Blair:
Designing Dependencies. 37-54 - Andrzej Blikle:
Why Denotational? Remarks on Applied Denotational Semantics. 55-85 - Jürgen Dix, Georg Gottlob, V. Wiktor Marek:
Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations. 87-100 - Melvin Fitting:
A Modal Herbrand Theorem. 101-122 - Georg Gottlob, Miroslaw Truszczynski:
Approximating the Stable Model Semantics is Hard. 123-128 - Jieh Hsiang, Anita Wasilewska:
Automating Algebraic Proofs in Algebraic Logic. 129-140 - Grazyna Mirkowska, Andrzej Salwicki:
The Algebraic Specifications do not Have the Tennenbaum Property. 141-152 - Jan A. Plaza:
Logic Programming from the Perspective of Algebraic Semantics. 153-164 - Vaughan R. Pratt, Jerzy Tiuryn:
Satisfiability of Inequalities in a Poset. 165-182 - Boris A. Trakhtenbrot:
On the Power of Compositional Proofs for Nets: Relationships Between Completeness and Modularity. 183-195 - Pawel Urzyczyn:
Positive Recursive Type Assignment. 197-209
Volume 28, Numbers 3-4, December 1996
- Mohua Banerjee, Mihir K. Chakraborty:
Rough Sets Through Algebraic Logic. 211-221 - Alexander Bochman
:
On a Logical Basis of Normal Logic Program. 223-245 - Nguyen Cat Ho
:
A Method in Linguistic Reasoning on a Knowledge Base Representing by Sentences with Linguistic Belief Degree. 247-259 - Patrick Doherty, Witold Lukaszewicz, Andrzej Szalas
:
A Reduction Result for Circumscribed Semi-Horn Formulas. 261-271 - John Green, Neil Horne, Ewa Orlowska, Paul Siemens:
A Rough Set Model of Information Retrieval. 273-296 - Dima Grigoriev, Marek Karpinski, Andrew M. Odlyzko:
Short Proofs for Nondivisibility of Sparse Polynomials under the Extended Riemann. 297-301 - Anna Gomolinska:
On Semantics for the Nonmonotonic Modal Formalization of the Logic of Acceptance and Rejection. 303-313 - Gheorghe Paun, Lech Polkowski, Andrzej Skowron:
Parallel Communicating Grammar Systems with Negotiation. 315-330 - Slavian Radev:
Argumentation Systems. 331-346 - Wladyslaw Skarbek:
Dynamic Behaviour of Spatial Signal OR-Graphs. 347-352 - Zbigniew Suraj:
Discovery of Concurrent Data Models from Experimental Tables: A Rough Set Approach. 353-376 - Karl Schlechta:
A Two-Stage Approach to First Order Default Reasoning. 377-402 - Józef Winkowski:
Concatenable Weighted Pomsets and Their Applications to Modelling Processes of Petri Nets. 403-421 - Jakub Wroblewski:
Theoretical Foundations of Order-Based Genetic Algorithms. 423-430
![](https://dblp.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.