Sciweavers

2062 search results - page 185 / 413
» Derivatives of Logical Formulas
Sort
View
CORR
2006
Springer
112views Education» more  CORR 2006»
15 years 4 months ago
Satisfying KBO Constraints
Abstract. This paper presents two new approaches to prove termination of rewrite systems with the Knuth-Bendix order efficiently. The constraints for the weight function and for th...
Harald Zankl, Aart Middeldorp
ENTCS
2006
172views more  ENTCS 2006»
15 years 4 months ago
Locality of Queries and Transformations
Locality is a standard notion of finite model theory. There are two well known flavors of it, based on Hanf's and Gaifman's theorems. Essentially they say that structure...
Leonid Libkin
CORR
2007
Springer
117views Education» more  CORR 2007»
15 years 4 months ago
Alternative axiomatics and complexity of deliberative STIT theories
We propose two alternatives to Xu’s axiomatization of Chellas’s STIT. The first one simplifies its presentation, and also provides an alternative axiomatization of the delib...
Philippe Balbiani, Andreas Herzig, Nicolas Troquar...
AI
2005
Springer
15 years 4 months ago
Knowledge and communication: A first-order theory
This paper presents a theory of informative communications among agents that allows a speaker to communicate to a hearer truths about the state of the world; the occurrence of eve...
Ernest Davis
SIAMCOMP
2000
86views more  SIAMCOMP 2000»
15 years 4 months ago
On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems
An exponential lower bound for the size of tree-like cutting planes refutations of a certain family of conjunctive normal form (CNF) formulas with polynomial size resolution refuta...
Maria Luisa Bonet, Juan Luis Esteban, Nicola Gales...