|
|
|
|
|
|
Date Reviewed |
|
|
1 - 10 of 12
reviews
|
|
|
|
|
|
|
|
Preferred answer sets for extended logic programs Brewka G. (ed), Eiter T. Artificial Intelligence 109(1-2): 297-356, 1999. Type: Article
The authors address the problem of providing answer set semantics to logic programs that are extended by allowing priorities on the rules. They follow the ideas of Gelfond and Lifschitz and introduce the notion of strong and weak answe...
|
Sep 1 1999 |
|
|
|
|
|
|
Logic of mathematics Adamowicz Z., Zbierski P., Wiley-Interscience, New York, NY, 1997. Type: Book (9780471060260)
The audience for this collection of lectures on the predicate calculus and Peano arithmetic is students of mathematics who would like to begin studying logic. Some topics are a bit too advanced and should be delayed until graduate scho...
|
Mar 1 1999 |
|
|
|
|
|
|
Essential transitions to bisimulation equivalences Eloranta J., Tienari M., Valmari A. Theoretical Computer Science 179(1-2): 397-419, 1997. Type: Article
The problem of minimizing the number of states and the number of transitions in labeled transition systems is addressed. The authors show that, for every weak-image-finite labeled transition system, there exists a unique labeled transi...
|
Dec 1 1997 |
|
|
|
|
|
|
Process versus unfolding semantics for place/transition Petri nets Meseguer J., Montanari U., Sassone V. (ed) Theoretical Computer Science 153(1-2): 171-210, 1996. Type: Article
A categorical approach is used to study the relationship among various semantics for place/transition Petri nets. In particular, the authors consider nonsequential processes semantics, unfolding semantics, and algebraic model semantics...
|
Aug 1 1997 |
|
|
|
|
|
|
Logic programming and non-monotonic reasoning Pereira L., Nerode A. Logic programming and non-monotonic reasoning, Lisbon, Portugal, 1993. Type: Whole Proceedings
Most of the papers presented at the second international workshop on Logic Programming and Non-monotonic Reasoning, held in Lisbon in June 1993, are presented here. The book is divided into six chapters....
|
Dec 1 1994 |
|
|
|
|
|
|
Predicate transformer semantics Manes E., Cambridge University Press, New York, NY, 1992. Type: Book (9780521420365)
The problem of providing a categorical basis for the predicate transformer semantics of nondeterministic programs is addressed. Program behavior is viewed as a morphism, and program concatenation is viewed as the composition of morphis...
|
Apr 1 1994 |
|
|
|
|
|
|
A canonical form for generalized linear constraints Lassez J. (ed), McAloon K. Journal of Symbolic Computation 13(1): 1-24, 1992. Type: Article
Interesting results in the area of constraint solving problems are presented. They can be of great use in the construction of efficient evaluators for constraint logic programming. The authors propose a canonical representation for lin...
|
Jun 1 1993 |
|
|
|
|
|
|
Adequacy-preserving transformations of COSY path programs Koutny M. Theoretical Computer Science 94(1): 141-158, 1992. Type: Article
The author studies the development process of a COSY path program [1] as the refinement of a single event in one path program Q, using the specification of another COSY path program P. This process, called insertion,
|
Mar 1 1993 |
|
|
|
|
|
|
Metacircularity in the polymorphic &lgr;-calculus Pfenning F. (ed), Lee P. (ed) Theoretical Computer Science 89(1): 137-159, 1991. Type: Article
The authors consider the problem of metacircularity in the polymorphic &lgr;-calculus. They first present an encoding of the Girard-Reynolds second-order polymorphic &lgr;-calculus in the third-order polymorphic &lgr;-calcu...
|
Nov 1 1992 |
|
|
|
|
|
|
Verifying temporal properties of systems Bradfield J., Birkhäuser Boston Inc., Cambridge, MA, 1992. Type: Book (9780817636258)
A powerful tableau technique for the verification of properties of both finite and infinite systems is introduced. The technique extends to the case of infinite systems the idea of finite local model-checking introduced by Stirling and...
|
Sep 1 1992 |
|
|
|
|
|
|
|
|
|
|
|