65 search results - page 2 / 13 » Preservation theorems for bounded formulas |
131
click to vote
ANLP
2000
15 years 5 months ago
2000
The process of documenting designs is tedious and often error-prone. We discuss a system that automatically generates documentation for the single step transition behavior of Stat...
133
click to vote
CORR
1998
Springer
15 years 3 months ago
1998
Springer
An important characteristic of many logics for Arti cial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequ...
121
click to vote
IGPL
2002
15 years 4 months ago
2002
Fibring is defined as a mechanism for combining logics with a firstorder base, at both the semantic and deductive levels. A completeness theorem is established for a wide class of...
105
click to vote
JCT
2007
15 years 4 months ago
2007
We show that the complexity of the Markov bases of multidimensional tables stabilizes eventually if a single table dimension is allowed to vary. In particular, if this table dimen...
150
click to vote
ECCC
2010
15 years 2 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...