Sciweavers

247 search results - page 19 / 50
» A Computational Structure for the Propositional Calculus
Sort
View
TABLEAUX
1999
Springer
13 years 11 months ago
Merge Path Improvements for Minimal Model Hyper Tableaux
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
Peter Baumgartner, Joseph Douglas Horton, Bruce Sp...
PERCOM
2006
ACM
14 years 7 months ago
QoS Routing in OLSR with Several Classes of Service
The Optimized Link State Routing (OLSR) protocol is a proactive link-state protocol bafor ad-hoc networks. It uses an optimization called Multi-Point Relays (MPRs) to provide an e...
Jeremie Leguay, Timur Friedman
BIRTHDAY
2009
Springer
14 years 2 months ago
Nonassociative Lambek Calculus with Additives and Context-Free Languages
We study Nonassociative Lambek Calculus with additives ∧, ∨, satisfying the distributive law (Distributive Full Nonassociative Lambek Calculus DFNL). We prove that categorial g...
Wojciech Buszkowski, Maciej Farulewski
ENTCS
2008
120views more  ENTCS 2008»
13 years 7 months ago
Towards a Quantum Calculus: (Work in Progress, Extended Abstract)
Progress, Extended Abstract) Philippe Jorrand1 Simon Perdrix2 Leibniz Laboratory IMAG-INPG Grenoble, France The aim of this paper is to introduce a general model of quantum comput...
Philippe Jorrand, Simon Perdrix
SARA
2000
Springer
13 years 11 months ago
Improving the Efficiency of Reasoning Through Structure-Based Reformulation
We investigate the possibility of improving the efficiency of reasoning through structure-based partitioning of logical theories, combined with partitionbased logical reasoning str...
Eyal Amir, Sheila A. McIlraith