14 search results - page 3 / 3 » apal 1999 |
APAL
1999
13 years 4 months ago
1999
We give a sound and complete propositional S5 tableau system of a particularly simple sort, having an easy completeness proof. It sheds light on why the satisfiability problem for...
APAL
1999
13 years 4 months ago
1999
We describe a new way to construct large subdirectly irreducibles within an equational class of algebras. We use this construction to show that there are forbidden geometries of m...
APAL
2005
13 years 4 months ago
2005
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...
APAL
1999
13 years 4 months ago
1999
Coalgebra develops a general theory of transition systems, parametric in a functor T; the functor T specifies the possible one-step behaviors of the system. A fundamental question...