C. Gunter. The mixed power domain. Theoretical Computer Science, 103:311-334, 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Sur La Verification De La Satisfaction Pour La Logique Des.. - Mahfoudh (2003) (Correct)
....23 . Using the resolution method to show that # is unsatisfiable. This method is attributed to Robinson [Rob65] but it was first proposed by Blake in 1937 [CS88] Important complexity studies have been carried out during the late 70 s and the 80 s and include the works of Galil [Gal77] Haken [Hak85] Urquhart [Urq87] and Chvatal and Szemeredi [CS88] Showing that the complement of # is not valid using a theorem prover. Until the 80 s, interest in SAT was motivated by the possibility of using a SAT solver as the main piece of a theorem prover for first order logic [DP60] Using ....
Armin Haken. The intractability of resolution. Theoretical Computer Science, 39:297--308, 1985.
About Translations of Classical Logic into Polarized Linear.. - Laurent, Regnier (Correct)
....denote der A : A A and dig A : A A the natural transformations associated to . To keep notations light we will also denote der A : A A and dig A : A A the dual natural transformations associated to the comonad . The property that U C has a left adjoint makes C a Lafont category [14]. A detailed proof that Lafont s categories are sound models of linear logic has been produced by Bierman (see [3, 4] It uses some interesting consequences of the existence of an adjunction among which: for any pair of objects A and B we have (A B) A P B. Any P monoid N is a ....
Y. Lafont. The linear abstract machine. Theoretical Computer Science, 59:157--180, 1988.
Expressive Power and Data Complexity of Nonrecursive - Query Languages For (Correct)
....theory of term algebras in which all function symbols have arity 1. The rst order theory of such term algebras is complete in LATIME(2 ) the class of problems solvable by alternating Turing machines running in exponential time but only with a linear number of alternations, for details see [14, 7, 32, 31, 34]. The range restricted fragment of rstorder logic over lists is PSPACE complete, so there is also a gap between the complexities of the full and the rangerestricted fragment. The next two theorems characterize the data complexity. As usual in the case of the data complexity, we restrict ....
L. Berman. The complexity of logical theories. Theoretical Computer Science, 11:71-77, 1980.
Existential and Positive Theories of Equations in Graph Products - Diekert, Lohrey (2003) (Correct)
....of equations is Presburger Arithmetic [38] Translated into our framework, the results of [16] give us the following: Proposition 7. The theories Th(Nk,RAT(Nk) and Th(Zk, RAT(Z) are decidable in doubly exponential space. Remark 8. Precise complexity bounds can be derived from the results in [3], which show that the theories in Proposition 7 are complete for doubly exponential alternating time with only a linear number of alternations. 7 Note that RAT(N k) and RAT(Z k) are the classes of semilinear sets in N and Z , respec tively. The following result can be easily deduced from ....
L. Berman. The complexity of logical theories. Theoretical Computer Science, 11:71- 77, 1980.
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube - Eisenbrand, Schulz (1999) (Correct)
....interest to mathematical logic and complexity theory. Cook, Coullard, and Turn [15] were the first to consider cutting plane proofs as a propositional proof system. In particular, they pointed out that the cutting plane proof system is a strengthening of resolution proofs. Since the work of Haken [30], exponential lower bounds are known for the latter. Results of Chvtal, Cook, and Hartmann [14] of Bonet, Pitassi, and Raz [8] of Impagliazzo, Pitassi, and Urquhart [35] and of Pudlk [40] imply exponential lower bounds on the length of cutting plane proofs as well. On the other hand, there is ....
A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297 -- 308, 1985.
Complexity of Semi-Algebraic Proofs - Grigoriev, Hirsch, Pasechnik (2002) (4 citations) (Correct)
....has no polynomial size B proofs. F denotes constant depth Frege systems. See Fig. 1 for other notation. Only the strongest separations relevant to semi algebraic systems are shown. The leftmost separation is due to PHP (the positive part is proved in [Pud99] the negative part is proved in [Hak85]) The counterexample for CP (which provides the two separations in the middle) is given by the clique coloring tautologies (resp. Theorem 4.1 and [Pud97] The two rightmost separations are due to Tseitin s formulas (resp. Theorem 6.1 and [BS02] Note that the knapsack problem is not a ....
A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297--308, 1985.
P != NP , Propositional Proof Complexity, and Resolution Lower.. - Raz (2002) (Correct)
....Pigeonhole Principle There are trivial Resolution proofs (and Regular Resolution proofs) of length poly(n) for the pigeonhole principle and for the weak pigeonhole principle. In a seminal paper, Haken proved that for the pigeonhole principle, the trivial proof is (almost) the best possible [7]. More speci cally, Haken proved that any Resolution proof for the tautology PHPn is of length 2 n) Haken s argument was further developed in several other papers (e.g. 18, 1, 4] In particular, it was shown that a similar argument gives lower bounds also for the weak pigeonhole ....
Haken, A., \The intractability of resolution," Theoretical Computer Science, 39(2-3), 1985, pp. 297-308.
Average Case Analysis of a Hard Dial-a-Ride Problem - Coja-Oghlan, Krumke, Nierhoff (2002) Self-citation (Dial-a-ride) (Correct)
....have to solve instances of the (offline ) DARP during their run [2, 4, 12] It is shown in [2] that an offline approximation algorithm for the DARP with approximation ratio # implies a c(#) competitive algorithm for the online version, where c(#) 4# 1 # 1 8# . Moreover, as shown in [18, 19] even for the case of minimizing the maximum or average waiting time online, an offline algorithm for the DARP which optimizes the length of a tour proves to be helpful, since it can be used to derive online performance guarantees. We conclude that there is a need to solve the (offline ) DARP in ....
, The online dial-a-ride problem under reasonable load, Theoretical Computer Science, (2001.
Modal Transition Systems: A Foundation for - Three-Valued Program Analysis (Correct)
No context found.
C. Gunter. The mixed power domain. Theoretical Computer Science, 103:311-334, 1992.
The Logical Approach to Stack Typing - Ahmed, Walker (2003) (7 citations) (Correct)
No context found.
Y. Lafont. The linear abstract machine. Theoretical Computer Science, 59:157--180, 1988.
Reasoning about Hierarchical Storage - Amal Ahmed Limin (2003) (4 citations) (Correct)
No context found.
Y. Lafont. The linear abstract machine. Theoretical Computer Science, 59:157--180, 1988.
The Bulletin of Symbolic Logic - Volume Number June (Correct)
No context found.
, The temporal semantics of concurrent programs, Theoretical Computer Science, vol. 13 (1981), pp. 45--60.
Semantic Representations and Query Languages for Or-Sets - Libkin, Wong (1993) (9 citations) (Correct)
No context found.
C. Gunter, The mixed powerdomain, Theoretical Computer Science 103 (1992), 311-- 334.
Decision Problems for Propositional Linear Logic - Patrick Lincoln John (1992) (67 citations) (Correct)
No context found.
Y. Lafont. The linear abstract machine. Theoretical Computer Science, 59:157--180, 1988.
Decision Problems for Propositional Linear Logic - Patrick Lincoln John (1992) (67 citations) (Correct)
No context found.
Y. Lafont. The linear abstract machine. Theoretical Computer Science, 59:157-- 180, 1988.
Decision Problems for Propositional Linear Logic - Patrick Lincoln John (1992) (67 citations) (Correct)
No context found.
Y. Lafont. The linear abstract machine. Theoretical Computer Science, 59:157--180, 1988.
On Resolution Complexity of Matching Principles - Dantchev (2002) (Correct)
No context found.
A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297--308, 1985.
Rank Bounds and Integrality Gaps for Cutting Planes.. - Buresh-Oppenheim.. (Correct)
No context found.
A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297--305, 1985.
Is There a Use for Linear Logic? - Wadler (1991) (5 citations) (Correct)
No context found.
Y. Lafont, The linear abstract machine. Theoretical Computer Science, 59:157-- 180, 1988.
A Taste of Linear Logic - Wadler (1993) (36 citations) (Correct)
No context found.
Y. Lafont, The linear abstract machine. Theoretical Computer Science, 59:157--180, 1988.
Call-by-Name, Call-by-Value, Call-by-Need, and the Linear.. - Maraist, Odersky, al. (1995) (1 citation) (Correct)
No context found.
Y. Lafont, The linear abstract machine. Theoretical Computer Science, 59:157--180, 1988.
Arithmetic Complexity, Kleene Closure, and Formal Power.. - Allender, Arvind, Mahajan (2003) (Correct)
No context found.
T. M. Hoang and T. Thierauf. The complexity of the characteristic and the minimal polynomial. Theoretical Computer Science, 295(1--3):205--222, 2003.
Bulletin of the Section of Logic - Volume Pp Michael (2002) (Correct)
No context found.
A. Haken, The intractability of resolution, Theoretical Computer Science 39 (1985), pp.297-305.
The Resolution Complexity of Random Constraint Satisfaction .. - Molloy, Salavatipour (Correct)
No context found.
A. Haken. The intractability of resolution. Theoretical Computer Science 39, 297 - 305 (1985).
Memoization and DPLL: Formula Caching Proof Systems - Paul Beame Computer (2003) (Correct)
No context found.
A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297--305, 1985.
Cutting Planes, Connectivity, and Threshold Logic - Samuel Buss Peter (1996) (5 citations) (Correct)
No context found.
A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297 -- 305, 1985.
Resolution Proofs of - Generalized Pigeonhole Principles (Correct)
No context found.
A. Haken, The intractability of resolution, Theoretical Computer Science, 39 (1985), pp. 297--308.
Resolution and the Weak Pigeonhole Principle - Buss, Pitassi (1996) (25 citations) (Correct)
No context found.
A. Haken, The intractability of resolution, Theoretical Computer Science, 39 (1985), pp. 297--308.
Reasoning about Hierarchical Storage - Amal Ahmed Limin (2003) (4 citations) (Correct)
No context found.
Y. Lafont. The linear abstract machine. Theoretical Computer Science, 59:157--180, 1988.
Bounded Arithmetic and Propositional Proof Complexity - Buss (1995) (1 citation) (Correct)
No context found.
A. Haken, The intractability of resolution, Theoretical Computer Science, 39 (1985), pp. 297--308.
Domain Theory - Corrected and expanded version - Abramsky, Jung (Correct)
No context found.
C. Gunter. The mixed power domain. Theoretical Computer Science, 103:311--334, 1992.
The Computational Complexity - Column By Dept (Correct)
No context found.
A. Haken. The intractability of resolution. Theoretical Computer Science, 39(2-3):297308, 1985.
The Efficiency of Resolution and Davis-Putnam Procedures - Beame, Karp, Pitassi, Saks (1999) (8 citations) (Correct)
No context found.
A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297-305, 1985.
On Bunched Typing - Peter Hearn Department (2002) (Correct)
No context found.
Y. Lafont. The linear abstract machine. Theoretical Computer Science, 59:157{ 180, 1988.
Names and Higher-Order Functions - Stark (1995) (29 citations) (Correct)
No context found.
Y. Lafont. The linear abstract machine. Theoretical Computer Science, 59:157--180, 1988. (p. 125)
Unrestricted vs Restricted Cut in a Tableau Method for .. - Järvisalo, Junttila.. (2004) (Correct)
No context found.
A. Haken. The intractability of resolution. Theoretical Computer Science, 39(2--3):297--308, 1985.
Fixed-Point Logics, Descriptive Complexity, And Random.. - Atserias (2002) (Correct)
No context found.
A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297--308, 1985.
A Switching Lemma for Small Restrictions and Lower.. - Segerlind, Buss.. (2002) (5 citations) (Correct)
No context found.
A. Haken. The intractability of resolution. Theoretical Computer Science, 39(2-3):297--308, August 1985.
Is P versus NP Formally Independent? - Aaronson (Correct)
No context found.
A. Haken. The intractability of resolution, Theoretical Computer Science 39:297--308, 1985.
Propositional Proofs and Their Complexity - Analytic Tableau.. - Mundhenk (2003) (Correct)
No context found.
A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297{ 305, 1985.
Lecture Notes on Computational Complexity - Trevisan (2004) (Correct)
No context found.
A. Haken. The intractibility of resolution. Theoretical Computer Science, 39:297--308, 1985.
The Logical Approach to Stack Typing - Ahmed, Walker (2003) (7 citations) (Correct)
No context found.
Y. Lafont. The linear abstract machine. Theoretical Computer Science, 59:157--180, 1988.
First-Order Proof Theory of Arithmetic - Buss (1998) (5 citations) (Correct)
No context found.
The polynomial-time hierarchy, Theoretical Computer Science, 3, pp. 1--22. G. Takeuti
Unrestricted vs Restricted Cut in a Tableau Method for .. - Järvisalo, Junttila.. (2004) (Correct)
No context found.
A. Haken. The intractability of resolution. Theoretical Computer Science, 39(2--3):297--308, 1985.
The Complexity of Resource-Bounded Propositional Proofs - Atserias (2001) (Correct)
No context found.
A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297-- 308, 1985.
On Sufficient Conditions for Unsatisfiability of Random Formulas - Atserias (2003) (Correct)
No context found.
A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297-- 308, 1985. 30
A Switching Lemma for Small Restrictions and Lower.. - Segerlind, Buss.. (2002) (5 citations) (Correct)
No context found.
A. Haken. The intractability of resolution. Theoretical Computer Science, 39(2-3):297--308, August 1985.
Good Degree Bounds on Nullstellensatz Refutations of the.. - Buss, Pitassi (1996) (3 citations) (Correct)
No context found.
A. Haken, The intractability of resolution, Theoretical Computer Science, 39 (1985), pp. 297--308.
Complexity of Semi-Algebraic Proofs - Dima Grigoriev Edward (2001) (4 citations) (Correct)
No context found.
A. Haken. The intractability of resolution. Theoretical Computer Science, 39:297-308, 1985.
Analysis of Algorithms (AofA): Part I: 1993 - 1998 ("Dagstuhl.. - Szpankowski (Correct)
No context found.
M. Drmota, The Variance of Binary Search Trees, Theoretical Computer Science, 270, 913-919, 2002.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC