Results 1  10
of
467,864
Hard examples for bounded depth Frege
, 2002
"... We prove exponential lower bounds on the size of a bounded depth Frege proof of a Tseitin graphbased contradiction, whenever the underlying graph is an expander. This is the first example of a contradiction, naturally formalized as a 3CNF, that has no short bounded depth Frege proofs. Previously, ..."
Abstract
 Add to MetaCart
We prove exponential lower bounds on the size of a bounded depth Frege proof of a Tseitin graphbased contradiction, whenever the underlying graph is an expander. This is the first example of a contradiction, naturally formalized as a 3CNF, that has no short bounded depth Frege proofs. Previously
Are there Hard Examples for Frege Systems?
"... It is generally conjectured that there is an exponential separation between Frege and extended Frege systems. This paper reviews and introduces some candidates for families of combinatorial tautologies for which Frege proofs might need to be superpolynomially longer than extended Frege proofs. S ..."
Abstract

Cited by 26 (3 self)
 Add to MetaCart
It is generally conjectured that there is an exponential separation between Frege and extended Frege systems. This paper reviews and introduces some candidates for families of combinatorial tautologies for which Frege proofs might need to be superpolynomially longer than extended Frege proofs
Are There Hard Examples for Frege Proof Systems?
, 1995
"... It is generally conjectured that there is an exponential separation between Frege and extended Frege systems. This paper reviews and introduces some candidates for families of combinatoriM tautologies for which Frege proofs might need to be superpolynomially longer than extended Frege proofs. Surpri ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
It is generally conjectured that there is an exponential separation between Frege and extended Frege systems. This paper reviews and introduces some candidates for families of combinatoriM tautologies for which Frege proofs might need to be superpolynomially longer than extended Frege proofs
Are there Hard Examples for Frege Systems?
"... It is generally conjectured that there is an exponential separation between Frege and extended Frege systems. This paper reviews and introduces some candidates for families of combinatorial tautologies for which Frege proofs might need to be superpolynomially longer than extended Frege proofs. Surpr ..."
Abstract
 Add to MetaCart
It is generally conjectured that there is an exponential separation between Frege and extended Frege systems. This paper reviews and introduces some candidates for families of combinatorial tautologies for which Frege proofs might need to be superpolynomially longer than extended Frege proofs
A New Method for Solving Hard Satisfiability Problems
 AAAI
, 1992
"... We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional approac ..."
Abstract

Cited by 734 (21 self)
 Add to MetaCart
We introduce a greedy local search procedure called GSAT for solving propositional satisfiability problems. Our experiments show that this procedure can be used to solve hard, randomly generated problems that are an order of magnitude larger than those that can be handled by more traditional
The StructureMapping Engine: Algorithm and Examples
 Artificial Intelligence
, 1989
"... This paper describes the StructureMapping Engine (SME), a program for studying analogical processing. SME has been built to explore Gentner's Structuremapping theory of analogy, and provides a "tool kit" for constructing matching algorithms consistent with this theory. Its flexibili ..."
Abstract

Cited by 512 (115 self)
 Add to MetaCart
, and demonstrate that most of the steps are polynomial, typically bounded by O (N 2 ). Next we demonstrate some examples of its operation taken from our cognitive simulation studies and work in machine learning. Finally, we compare SME to other analogy programs and discuss several areas for future work. This paper
Scheduling Algorithms for Multiprogramming in a HardRealTime Environment
, 1973
"... The problem of multiprogram scheduling on a single processor is studied from the viewpoint... ..."
Abstract

Cited by 3712 (2 self)
 Add to MetaCart
The problem of multiprogram scheduling on a single processor is studied from the viewpoint...
Nonautomatizability of boundeddepth Frege proofs
, 1999
"... In this paper, we show how to extend the argument due to Bonet, Pitassi and Raz to show that boundeddepth Frege proofs do not have feasible interpolation, assuming that factoring of Blum integers or computing the DiffieHellman function is sufficiently hard. It follows as a corollary that boundedde ..."
Abstract

Cited by 30 (8 self)
 Add to MetaCart
In this paper, we show how to extend the argument due to Bonet, Pitassi and Raz to show that boundeddepth Frege proofs do not have feasible interpolation, assuming that factoring of Blum integers or computing the DiffieHellman function is sufficiently hard. It follows as a corollary that boundeddepth
The Protection of Information in Computer Systems
, 1975
"... This tutorial paper explores the mechanics of protecting computerstored information from unauthorized use or modification. It concentrates on those architectural structureswhether hardware or softwarethat are necessary to support information protection. The paper develops in three main sections ..."
Abstract

Cited by 815 (2 self)
 Add to MetaCart
architecture. It examines in depth the principles of modern protection architectures and the relation between capability systems and access control list systems, and ends with a brief analysis of protected subsystems and protected objects. The reader who is dismayed by either the prerequisites or the level
On Frege and Extended Frege Proof Systems
, 1993
"... We propose a framework for proving lower bounds to the size of EF  proofs (equivalently, to the number of proofsteps in Fproofs) in terms of boolean valuations . The concept is motivated by properties of propositional provability in models of bounded arithmetic and it is a finitisation of a parti ..."
Abstract

Cited by 21 (4 self)
 Add to MetaCart
bounds (up to a polynomial increase). Introduction A propositional proof system is any polynomial time function P whose range is exactly the set of tautologies TAUT, cf. [17]. For ø a tautology any string ß such that P (ß) = ø is called a P proof of ø . Any usual propositional calculus
Results 1  10
of
467,864