247 search results - page 19 / 50 » A Computational Structure for the Propositional Calculus |
146
Voted
TABLEAUX
1999
Springer
15 years 8 months ago
1999
Springer
We combine techniques originally developed for refutational first-order theorem proving within the clause tree framework with techniques for minimal model computation developed wi...
114
Voted
PERCOM
2006
ACM
16 years 3 months ago
2006
ACM
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...
123
Voted
BIRTHDAY
2009
Springer
15 years 10 months ago
2009
Springer
We study Nonassociative Lambek Calculus with additives ∧, ∨, satisfying the distributive law (Distributive Full Nonassociative Lambek Calculus DFNL). We prove that categorial g...
122
Voted
ENTCS
2008
15 years 4 months ago
2008
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...
102
Voted
SARA
2000
Springer
15 years 7 months ago
2000
Springer
We investigate the possibility of improving the efficiency of reasoning through structure-based partitioning of logical theories, combined with partitionbased logical reasoning str...