Sciweavers

77 search results - page 1 / 16
» Guarded Fixed Point Logic
Sort
View
LICS
1999
IEEE
13 years 8 months ago
Guarded Fixed Point Logic
Guarded fixed point logics are obtained by adding least and greatest fixed points to the guarded fragments of firstorder logic that were recently introduced by Andr
Erich Grädel, Igor Walukiewicz
CORR
2004
Springer
97views Education» more  CORR 2004»
13 years 4 months ago
The semijoin algebra and the guarded fragment
In the 1970s Codd introduced the relational algebra, with operators selection, projection, union, difference and product, and showed that it is equivalent to first-order logic. In ...
Dirk Leinders, Jerzy Tyszkiewicz, Jan Van den Buss...
FOIKS
2006
Springer
13 years 8 months ago
Guarded Open Answer Set Programming with Generalized Literals
Abstract. We extend the open answer set semantics for programs with generalized literals. Such extended programs (EPs) have interesting properties, e.g. the ability to express infi...
Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
ENTCS
2002
66views more  ENTCS 2002»
13 years 4 months ago
Unique, guarded fixed points in an additive setting: Extended Abstract
Abstract Stephen L. Bloom Department of Computer Science Stevens Institute of Technology Hoboken, NJ 07030 and Zolt
Stephen L. Bloom, Zoltán Ésik
CONCUR
2010
Springer
13 years 5 months ago
Flat Coalgebraic Fixed Point Logics
Fixed point logics are widely used in computer science, in particular in artificial intelligence and concurrency. The most expressive logics of this type are the
Lutz Schröder, Yde Venema