Sciweavers

3573 search results - page 306 / 715
» Reasoning about Codata
Sort
View
LPNMR
1993
Springer
15 years 10 months ago
Negation as Partial Failure
We present a logic programming language which uses a four-valued bilattice as the underlying framework for semantics of programs. The two orderings of the bilattice reflect the c...
Bamshad Mobasher, Jacek Leszczylowski, Don Pigozzi
NMELP
1994
15 years 10 months ago
Static Semantics as Program Transformation and Well-founded Computation
In this paper, we propose a new constructive characterization of those semantics for disjunctive logic programs which are extensions of the well-founded semantics for normal progra...
Stefania Costantini, Gaetano Aurelio Lanzarone
IFIP
1992
Springer
15 years 10 months ago
Intelligent Access to Data and Knowledge Bases via User's Topics of Interest
Retrieving relevant information in Data and Knowledge Bases containing a large number of di erent types of information is a non trivial problem. That is the reason why, in areas l...
Sylvie Cazalens, Robert Demolombe
FLOPS
2004
Springer
15 years 10 months ago
Analysing Definitional Trees: Looking for Determinism
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
Pascual Julián Iranzo, Christian Villamizar...
CSL
2006
Springer
15 years 10 months ago
Algorithms for Omega-Regular Games with Imperfect Information,
We study observation-based strategies for two-player turn-based games on graphs with omega-regular objectives. An observation-based strategy relies on imperfect information about t...
Krishnendu Chatterjee, Laurent Doyen, Thomas A. He...