Results 1  10
of
1,291
An Algorithm for the Class of Pure Implicational Formulas
"... Heusch introduced the notion of pure implicational formulas. He showed that the falsifiability problem for pure implicational formulas with k negations is solvable in time O(n^k). Such falsifiability results are easily transformed to satisfiability results on CNF formulas. We show that the falsif ..."
Abstract

Cited by 12 (6 self)
 Add to MetaCart
Heusch introduced the notion of pure implicational formulas. He showed that the falsifiability problem for pure implicational formulas with k negations is solvable in time O(n^k). Such falsifiability results are easily transformed to satisfiability results on CNF formulas. We show
Proof complexity of intuitionistic implicational formulas
"... Abstract We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of intuitionistic extended Frege (EF ) or substitution ..."
Abstract
 Add to MetaCart
Abstract We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of intuitionistic extended Frege (EF
Implicative Formulae in the Vroofs as Computations ” Analogy
"... In [As871 a correspondence between the subset of Linear Logic [Gi86] involving the conjunctive tensor product only and PlacelTransition Petri Nets IRei is established. In this correspondence, formulae are regarded as distributed states and provable seqnents are computations in the net. Developing th ..."
Abstract
 Add to MetaCart
In [As871 a correspondence between the subset of Linear Logic [Gi86] involving the conjunctive tensor product only and PlacelTransition Petri Nets IRei is established. In this correspondence, formulae are regarded as distributed states and provable seqnents are computations in the net. Developing
The Complexity of the Falsifiability Problem for Pure Implicational Formulas
 PROC. 20TH INT'L SYMPOSIUM ON MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE (MFCS'95), J. WIEDERMANN, P. HAJEK (EDS.), PRAGUE, CZECH REPUBLIC. LECTURE NOTES IN COMPUTER SCIENCE (LNCS 969
, 1995
"... Since it is unlikely that any NPcomplete problem will ever be efficiently solvable, one is interested in identifying those special cases that can be solved in polynomial time. We deal with the special case of Boolean formulas where the logical implication ! is the only operator and any variable (ex ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
Since it is unlikely that any NPcomplete problem will ever be efficiently solvable, one is interested in identifying those special cases that can be solved in polynomial time. We deal with the special case of Boolean formulas where the logical implication ! is the only operator and any variable
Logic Programming in a Fragment of Intuitionistic Linear Logic
, 1994
"... When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ ..."
Abstract

Cited by 340 (44 self)
 Add to MetaCart
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal of the form D ⊃ G from the context (set of formulas) Γ leads to an attempt to prove the goal G in the extended context Γ
Hard and Easy Distributions of SAT Problems
, 1992
"... We report results from largescale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to ..."
Abstract

Cited by 255 (20 self)
 Add to MetaCart
We report results from largescale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible
Nonperturbative formulas for central functions of supersymmetric gauge theories
 Nucl. Phys. B
, 1998
"... For quantum field theories that flow between ultraviolet and infrared fixed points, central functions, defined from twopoint correlators of the stress tensor and conserved currents, interpolate between central charges of the UV and IR critical theories. We develop techniques that allow one to calcu ..."
Abstract

Cited by 164 (27 self)
 Add to MetaCart
to calculate the flows of the central charges and that of the Euler trace anomaly coefficient in a general N=1 supersymmetric gauge theory. Exact, explicit formulas for SU(Nc) gauge theories in the conformal window are given and analysed. The Euler anomaly coefficient always satisfies the inequality aUV −a
Macroscopic Entropy Formulae and NonHolomorphic Corrections for Supersymmetric Black Holes
, 1999
"... In fourdimensional N = 2 compactifications of string theory or Mtheory, modifications of the BekensteinHawking area law for black hole entropy in the presence of higherderivative interactions are crucial for finding agreement between the macroscopic entropy obtained from supergravity and sublead ..."
Abstract

Cited by 99 (8 self)
 Add to MetaCart
to heterotic N = 4 supersymmetric black holes and their typeII duals and we discuss its implications for the corresponding microstate counting. In the effective field theory approach the Wilsonian coupling functions are known to receive nonholomorphic corrections. We discuss how to incorporate
Representing Boolean formulas by using trees of implicants and implicates
"... Abstract — A new treebased representation for propositional formulas is introduced. This representation, the ∆trees, allows a compact representation for wellformed formulas as well as a number of reduction strategies in order to consider only those occurrences of literals which are relevant for t ..."
Abstract
 Add to MetaCart
Abstract — A new treebased representation for propositional formulas is introduced. This representation, the ∆trees, allows a compact representation for wellformed formulas as well as a number of reduction strategies in order to consider only those occurrences of literals which are relevant
Results 1  10
of
1,291