LTUR: a simplified linear-time unit resolution algorithm for Horn formulae and computer implementationMINOUX, M.Information processing letters. 1988, Vol 29, Num 1, pp 1-12, issn 0020-0190Article

Model checking the full modal mu-calculus for infinite sequential processesBURKART, O; STEFFEN, B.Lecture notes in computer science. 1997, pp 419-429, issn 0302-9743, isbn 3-540-63165-8Conference Paper

Automatic abstraction techniques for propositional μ-calculus model checkingPARDO, A; HACHTEL, G. D.Lecture notes in computer science. 1997, pp 12-23, issn 0302-9743, isbn 3-540-63166-6Conference Paper

Survey of Disjoint NP-pairs and Relations to Propositional Proof SystemsGLASSER, Christian; SELMAN, Alan L; LIYU ZHANG et al.Theoretical computer science (essays in memory of Shimon Even). Lecture notes in computer science. 2006, pp 241-253, issn 0302-9743, isbn 3-540-32880-7, 1Vol, 13 p.Book Chapter

Solving satisfiability via Boltzmann machinesD'ANJOU, A; GRANA, M; TORREALDEA, F. J et al.IEEE transactions on pattern analysis and machine intelligence. 1993, Vol 15, Num 5, pp 514-521, issn 0162-8828Article

An inside view of EXP ; or, the closed fragment of the provability logic of IΔ₀+Ω₁ with a propositional constant for EXPVISSER, A.The Journal of symbolic logic. 1992, Vol 57, Num 1, pp 131-165, issn 0022-4812Article

Ancestral Kripke models and nonhereditary Kripke models for the Heyting propositional calculusDOSEN, K.Notre Dame journal of formal logic. 1991, Vol 32, Num 4, pp 580-597, issn 0029-4527Article

An intuitionistic Sheffer functionDOSEN, K.Notre Dame journal of formal logic. 1985, Vol 26, Num 4, pp 479-482, issn 0029-4527Article

Remark on the intuitionistic fuzzy logicsATANASSOV, K. T.Fuzzy sets and systems. 1998, Vol 95, Num 1, pp 127-129, issn 0165-0114Article

New intuitionistic logical constants : Undecidability of the Conservativeness problemYASHIN, A. D.Lecture notes in computer science. 1997, pp 460-471, issn 0302-9743, isbn 3-540-63172-0Conference Paper

La créativité des définitions dans les systèmes para-euclidiens = The creativity of definitions in the paraeuclidean systemsGINISTI, J.-P.Mathématiques, informatique et sciences humaines. 1991, Num 116, pp 69-88, issn 0995-2314Article

The axiomatization for 0-level universal logicYINGCANG MA; HUACAN HE.Lecture notes in computer science. 2006, pp 367-376, issn 0302-9743, isbn 3-540-33584-6, 1Vol, 10 p.Conference Paper

Bisimulation and propositional intuitionistic logicPATTERSON, A.Lecture notes in computer science. 1997, pp 347-360, issn 0302-9743, isbn 3-540-63141-0Conference Paper

On the Σ₁⁰-conservativity of Σ₁⁰-completenessVISSER, A.Notre Dame journal of formal logic. 1991, Vol 32, Num 4, pp 554-561, issn 0029-4527Article

Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculusRYBAKOV, V. V.Annals of pure and applied logic. 1990, Vol 50, Num 1, pp 71-106, issn 0168-0072, 36 p.Article

The complexity of resolution with generalized symmetry rulesSZEIDER, Stefan.Lecture notes in computer science. 2003, pp 475-486, issn 0302-9743, isbn 3-540-00623-0, 12 p.Conference Paper

The inference problem for propositional circumscription of affine formulas is coNP-completeDURAND, Arnaud; HERMANN, Miki.Lecture notes in computer science. 2003, pp 451-462, issn 0302-9743, isbn 3-540-00623-0, 12 p.Conference Paper

Resolution refutations and propositional proofs with height-restrictionsBECKMANN, Arnold.Lecture notes in computer science. 2002, pp 599-612, issn 0302-9743, isbn 3-540-44240-5, 14 p.Conference Paper

Symbolic model checking for μ-calculus requires exponential timeRABINOVICH, A.Theoretical computer science. 2000, Vol 243, Num 1-2, pp 467-475, issn 0304-3975Article

Comments on : Some versions of intuitionistic fuzzy propositional calculus due to K. Atanassov and G. GargovEL-HAKEIM, K. M. A; ZEYADA, F. M.Fuzzy sets and systems. 2000, Vol 110, Num 3, pp 451-452, issn 0165-0114Article

Behavioural characterizations of partial order logicsVIRBITSKAITE, I; VOTINTSEVA, A.Lecture notes in computer science. 1997, pp 463-474, issn 0302-9743, isbn 3-540-63386-3Conference Paper

On an optimal quantified propositional proof system and a complete language for NP ∩ co-NPSADOWSKI, Z.Lecture notes in computer science. 1997, pp 423-428, issn 0302-9743, isbn 3-540-63386-3Conference Paper

Resolution for quantified Boolean formulasKLEINE BÜNING, H; KARPINSKI, M; FLÖGEL, A et al.Information and computation (Print). 1995, Vol 117, Num 1, pp 12-18, issn 0890-5401Article

Bounded-depth Frege systems with counting axioms polynomially simulate Nullstellensatz refutations: (Extended abstract)IMPAGLIAZZO, Russell; SEGERLIND, Nathan.Lecture notes in computer science. 2002, pp 208-219, issn 0302-9743, isbn 3-540-43864-5, 12 p.Conference Paper

The equivalence problem for computational models : Decidable and undecidable casesZAKHAROV, Vladimir A.Lecture notes in computer science. 2001, pp 133-152, issn 0302-9743, isbn 3-540-42121-1Conference Paper