Sciweavers

2766 search results - page 421 / 554
» Hybridizing a Logical Framework
Sort
View
137
Voted
ICALP
2010
Springer
15 years 9 months ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
LICS
2000
IEEE
15 years 8 months ago
Automatic Structures
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collec...
Achim Blumensath, Erich Grädel
AMAST
2000
Springer
15 years 8 months ago
Distance Functions for Defaults in Reactive Systems
Default reasoning has become an important topic in software engineering. In particular, defaults can be used to revise speci cations, to enhance reusability of existing systems, an...
Sofia Guerra
ICTL
1994
15 years 8 months ago
Abduction in Temporal Reasoning
Commonsense knowledge often omits the temporal incidence of facts, and even the ordering between occurrences is only available for some of their instances. Reasoning about the temp...
Cristina Ribeiro, António Porto
150
Voted
LPNMR
1993
Springer
15 years 8 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