David Harel - researchr profile publications

researchr

You are not signed in
Sign in
Sign up

[Clear Filters]

Publications tagged logic

Logic and Theory of Algorithms, 4th Conference on Computability in Europe, CiE 2008, Athens, Greece, June 15-20, 2008, ProceedingsArnold Beckmann, Costas Dimitracopoulos, Benedikt Löwe, editors, Volume 5028 of Lecture Notes in Computer Science, Springer, 2008.

Approximation Schemes in Logic and Artificial IntelligenceVictor W. Marek, Miroslaw Truszczynski. trs, 9:135-144, 2008. [doi]

Temporal Logic for Scenario-Based SpecificationsHillel Kugler, David Harel, Amir Pnueli, Yuan Lu, Yves Bontemps. TACAS 2005: 445-460 [doi]

Decision Procedure for a Fragment of Mutual Belief Logic with Quantified Agent VariablesRegimantas Pliuskevicius, Aida Pliuskeviciene. clima 2006: 112-128 [doi]

Logics in Artificial Intelligence, 9th European Conference, JELIA 2004, Lisbon, Portugal, September 27-30, 2004, ProceedingsJosé Júlio Alferes, João Alexandre Leite, editors, Volume 3229 of Lecture Notes in Computer Science, Springer, 2004.

Computational Logic in Multi-Agent Systems, 4th International Workshop, CLIMA IV, Fort Lauderdale, FL, USA, January 6-7, 2004, Revised Selected and Invited PapersJürgen Dix, João Alexandre Leite, editors, Volume 3259 of Lecture Notes in Computer Science, Springer, 2004.

Using an electronic voting system in logic lectures: one practitioner s applicationS. A. J. Stuart, M. I. Brown, Stephen W. Draper. jcal, 20(2):95-102, 2004. [doi]

On the Computational Complexity of Cut-Elimination in Linear LogicHarry G. Mairson, Kazushige Terui. ictcs 2003: 23-36 [doi]

A Decidable CLDS for Some Propositional Resource LogicsKrysia Broda. BIRTHDAY 2002: 135-159 [doi]

The Pointer Assertion Logic EngineAnders Møller, Michael I. Schwartzbach. PLDI 2001: 221-231

Theorem Proving in Higher Order Logics, 14th International Conference, TPHOLs 2001, Edinburgh, Scotland, UK, September 3-6, 2001, ProceedingsRichard J. Boulton, Paul B. Jackson, editors, Volume 2152 of Lecture Notes in Computer Science, Springer, 2001.

Theorem Proving in Higher Order Logics, 13th International Conference, TPHOLs 2000, Portland, Oregon, USA, August 14-18, 2000, ProceedingsMark Aagaard, John Harrison, editors, Volume 1869 of Lecture Notes in Computer Science, Springer, 2000.

Computation Paths Logic: An Expressive, yet Elementary, Process LogicDavid Harel, Eli Singerman. APAL, 96(1-3):167-186, 1999.

Fuzzy Logic - A Modern PerspectiveJohn Yen. tkde, 11(1):153-165, 1999. [doi]

Corrigendum to Galmiche s and Perrier s On Proof Normalization in Linear Logic Guy Perrier. TCS, 206(1-2):353-354, 1998. [doi]

Computation Paths Logic: An Expressive, yet Elementary, Process Logic (abridged version)David Harel, Eli Singerman. icalp 1997: 408-418

Complexity Results for Two-Way and Multi-Pebble Automata and their LogicsNoa Globerman, David Harel. TCS, 169(2):161-184, 1996. [doi]

Discursive logic. Towards a logic of rational discourseMax P. Urchs. sLogica, 54(2):231-249, 1995.

Belief Revision, Conditional Logic and Nonmonotonic ReasoningWayne Wobcke. ndjfl, 36(1):55-102, 1995.

Complexity Results for Multi-Pebble Automata and their LogicsNoa Globerman, David Harel. icalp 1994: 73-82

Johan van Benthem, Language in Action: Categories, Lambdas and Dynamic LogicDavid J. Israel. ai, 63(1-2):503-510, 1993.

Computational Logic - Essays in Honor of Alan Robinson1991.

Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, School/Workshop, Noordwijkerhout, The Netherlands, May 30 - June 3, 1988, ProceedingsJ. W. de Bakker, Willem P. de Roever, Grzegorz Rozenberg, editors, Volume 354 of Lecture Notes in Computer Science, Springer, 1989.

Finite and Finitely Separable Intermediate Propositional LogicsFabio Bellissima. JSYML, 53(2):403-420, 1988.

A Foray Into Combinatory LogicBarney Glickfeld, Ross A. Overbeek. JAR, 2(4):419-431, 1986.

Process Logic with Regular FormulasDavid Harel, David Peleg. TCS, 38:307-322, 1985.

More on Looping vs. Repeating in Dynamic LogicDavid Harel, David Peleg. ipl, 20(2):87-90, 1985.

Propositional Dynamic Logic of FlowchartsDavid Harel, Rivi Sherman. iandc, 64(1-3):119-135, January/February/March 1985.

On Static Logics, Dynamic Logics, and Complexity ClassesDavid Harel, David Peleg. iandc, 60(1-3):86-102, January/February/March 1984.

A Probabilistic Dynamic LogicYishai A. Feldman, David Harel. jcss, 28(2):193-215, 1984.

Is the Interesting Part of Process Logic Uninteresting? A Translation from PL to PDLRivi Sherman, Amir Pnueli, David Harel. SICOMP, 13(4):825-839, 1984.

Propositional Dynamic Logic of FlowchartsDavid Harel, Rivi Sherman. fct 1983: 195-206

Propositional Dynamic Logic of Nonregular ProgramsDavid Harel, Amir Pnueli, Jonathan Stavi. jcss, 26(2):222-243, 1983.

A Probabilistic Dynamic LogicYishai A. Feldman, David Harel. stoc 1982: 181-195

Looping vs. Repeating in Dynamic LogicDavid Harel, Rivi Sherman. iandc, 55(1-3):175-192, October/November/December 1982.

Process Logic: Expressiveness, Decidability, CompletenessDavid Harel, Dexter Kozen, Rohit Parikh. jcss, 25(2):144-170, 1982.

Is the Interesting Part of Process Logic Uninteresting - A Translation from PL to PDLRivi Sherman, Amir Pnueli, David Harel. POPL 1982: 347-360

Further Results on Propositional Dynamic Logic of Nonregular ProgramsDavid Harel, Amir Pnueli, Jonathan Stavi. lop 1982: 124-136

Propositional Dynamic Logic of Context-Free ProgramsDavid Harel, Amir Pnueli, Jonathan Stavi. focs 1981: 310-321

A Proof of the Associated Sheaf Theorem by Means of Categorical LogicBarbara Veit. JSYML, 46(1):45-55, 1981.

Process Logic: Expressiveness, Decidability, CompletenessDavid Harel, Dexter Kozen, Rohit Parikh. focs 1980: 129-142

Proving the Correctness of Regular Deterministic Programs: A Unifying Survey Using Dynamic LogicDavid Harel. TCS, 12:61-81, 1980.

First-Order Dynamic LogicDavid Harel. Volume 68 of Lecture Notes in Computer Science, Springer, 1979.

Two Results on Process LogicDavid Harel. ipl, 8(4):195-198, 1979.

Recursion in Logics of ProgramsDavid Harel. POPL 1979: 81-92 [doi]

Nondeterminism in Logics of ProgramsDavid Harel, Vaughan R. Pratt. POPL 1978: 203-213

Arithmetical Completeness in Logics of ProgramsDavid Harel. icalp 1978: 268-288

Computability and Completeness in Logics of Programs (Preliminary Report)David Harel, Albert R. Meyer, Vaughan R. Pratt. stoc 1977: 261-268

ULM Implicants for Minimization of Universal Logic Module CircuitsRaymond P. Voith. TC, 26(5):417-424, 1977.

Annual Meeting of the Association for Symbolic LogicBurton Dreben, James Thomson. JSYML, 33(4):636-645, 1968.

runs on WebDSL