Sciweavers

130 search results - page 23 / 26
» The road to two theorems of logic
Sort
View
CADE
2005
Springer
15 years 10 months ago
The Decidability of the First-Order Theory of Knuth-Bendix Order
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...
Ting Zhang, Henny B. Sipma, Zohar Manna
LICS
2007
IEEE
15 years 4 months ago
A Robust Class of Context-Sensitive Languages
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
CONTEXT
2003
Springer
15 years 3 months ago
On the Difference between Bridge Rules and Lifting Axioms
Abstract. In a previous paper, we proposed a first formal and conceptual comparison between the two most important formalizations of context in AI: Propositional Logic of Context ...
Paolo Bouquet, Luciano Serafini
IJCAI
1993
14 years 11 months ago
A Metalogic Programming Approach to Reasoning about Time in Knowledge Bases
The problem of representing and reasoning about two notions of time that are relevant in the context of knowledge bases is addressed. These are called historical time and belief t...
Suryanarayana M. Sripada
IANDC
2006
103views more  IANDC 2006»
14 years 9 months ago
Bisimulation and cocongruence for probabilistic systems
We introduce a new notion of bisimulation, called event bisimulation on labelled Markov processes (LMPs) and compare it with the, now standard, notion of probabilistic bisimulatio...
Vincent Danos, Josee Desharnais, François L...