Sciweavers

12774 search results - page 164 / 2555
» A Framework for Proof Systems
Sort
View
COCO
2010
Springer
129views Algorithms» more  COCO 2010»
15 years 8 months ago
On the Relative Strength of Pebbling and Resolution
The last decade has seen a revival of interest in pebble games in the context of proof complexity. Pebbling has proven to be a useful tool for studying resolution-based proof syst...
Jakob Nordström
LCN
1999
IEEE
15 years 8 months ago
AQuaFWiN: Adaptive QoS Framework for Multimedia in Wireless Networks and Its Comparison with other QoS Frameworks
In a wireless environment, due to topology changes and characteristics of media (interference in radio signals) the bandwidth of a link is unpredictable and possibly very low, the...
Bobby Vandalore, Raj Jain, Sonia Fahmy, Sudhir S. ...
MCU
2007
123views Hardware» more  MCU 2007»
15 years 6 months ago
Study of Limits of Solvability in Tag Systems
Abstract. In this paper we will give an outline of the proof of the solvability of the halting and reachability problem for 2-symbolic tag systems with a deletion number v = 2. Thi...
Liesbeth De Mol
JUCS
2007
102views more  JUCS 2007»
15 years 4 months ago
Pedagogical Natural Deduction Systems: the Propositional Case
: This paper introduces the notion of pedagogical natural deduction systems, which are natural deduction systems with the following additional constraint: all hypotheses made in a ...
Loïc Colson, David Michel
CADE
2007
Springer
16 years 4 months ago
SRASS - A Semantic Relevance Axiom Selection System
This paper describes the design, implementation, and testing of a system for selecting necessary axioms from a large set also containing superfluous axioms, to obtain a proof of a...
Geoff Sutcliffe, Yury Puzis