156 search results - page 10 / 32 » Decidability and Undecidability in Probability Logic |
IGPL
2008
13 years 8 months ago
2008
We propose here an extension of Rice's Theorem to first-order logic, proven by totally elementary means. If P is any property defined over the collection of all first-order t...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The paper proposes and studies temporal logics for attributed words, that is, data words with a (finite) set of (attribute,value)-pairs at each position. It considers a basic logi...
CADE
2005
Springer
14 years 9 months ago
2005
Springer
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
AAAI
1990
13 years 9 months ago
1990
Since knowledge bases (KBs) are usually incomplete, they should be able to provide information regarding their own incompleteness, which requires them to introspect on what they k...
CSL
2006
Springer
14 years 8 days ago
2006
Springer
Rational graphs are a family of graphs defined using labelled rational transducers. Unlike automatic graphs (defined using synchronized transducers) the first order theory of these...