Sciweavers

10542 search results - page 232 / 2109
» A General Notion of Useful Information
Sort
View
APAL
2005
135views more  APAL 2005»
15 years 6 months ago
Safe beliefs for propositional theories
We propose an extension of answer sets, that we call safe beliefs, that can be used to study several properties and notions of answer sets and logic programming from a more genera...
Mauricio Osorio, Juan Antonio Navarro Pérez...
IJAC
2000
62views more  IJAC 2000»
15 years 6 months ago
On Dehn Functions of Amalgamations and Strongly Undistorted Subgroups
We study the Dehn functions of amalgamations, introducing the notion of strongly undistorted subgroups. Using this, we give conditions under which taking an amalgamation does not i...
Stephen G. Brick, Jon M. Corson
ENTCS
2002
69views more  ENTCS 2002»
15 years 6 months ago
The Uniformity Principle on Traced Monoidal Categories
The uniformity principle for traced monoidal categories has been introduced as a natural generalization of the uniformity principle (Plotkin's principle) for fixpoint operato...
Masahito Hasegawa
IANDC
1998
106views more  IANDC 1998»
15 years 6 months ago
A Conservative Look at Operational Semantics with Variable Binding
We set up a formal framework to describe transition system specifications in the style of Plotkin. This framework has the power to express many-sortedness, general binding mechan...
Wan Fokkink, Chris Verhoef
MLQ
2002
95views more  MLQ 2002»
15 years 6 months ago
Invariant Logics
A modal logic is called invariant if for all automorphisms of NExt K, () = . An invariant logic is therefore uniquely determined by its surrounding in the lattice. It will be est...
Marcus Kracht