Howard A. Blair

Howard A. Blair, Victor W. Marek, Jeffrey B. Remmel: Set based logic programming. Ann. Math. Artif. Intell. 52(1): 81-105 (2008)

Howard A. Blair, David W. Jakel, Robert J. Irwin, A. J. Rivera: Hybrid Programs: Symmetrically Combining Natively Discrete and Continuous Truth-values. ISAIM 2008

Howard A. Blair, David W. Jakel, Robert J. Irwin, Angel Rivera: Elementary Differential Calculus on Discrete and Hybrid Structures. LFCS 2007: 41-53

Howard A. Blair: Elementary Differential Calculus on Discrete, Continuous and Hybrid Spaces. Computational Structures for Modelling Space, Time and Causality 2006

Howard A. Blair: Dynamical Properties of Answer Set Programs. Answer Set Programming 2001

Howard A. Blair: The Differential Scheme for Models of Computation. Electr. Notes Theor. Comput. Sci. 40: 3 (2000)

Howard A. Blair: Locating Self-Organization at the Edge of Chaos. Electr. Notes Theor. Comput. Sci. 40: 4 (2000)

Howard A. Blair, Jagan Chidella, Fred Dushin, Audrey Ferry, Paul R. Humenn: A Continuum of Discrete Systems. Ann. Math. Artif. Intell. 21(2-4): 153-186 (1997)

Howard A. Blair, Fred Dushin, Paul R. Humenn: Simulations between Programs as Cellular Automata. LPNMR 1997: 115-131

Howard A. Blair: Designing Dependencies. Fundam. Inform. 28(1-2): 37-54 (1996)

Howard A. Blair, V. Wiktor Marek, John S. Schlipf: The Expressiveness of Locally Stratified Programs. Ann. Math. Artif. Intell. 15(2): 209-229 (1995)

Howard A. Blair: Game Characterizations of Logic Program Properties. LPNMR 1995: 99-112

Peter Cholak, Howard A. Blair: The Complexity of Local Stratification. Fundam. Inform. 21(4): 333-344 (1994)

Mino Bai, Howard A. Blair: General Model Theoretic Semantics for Higher-Order Horn Logic Programming. LPAR 1992: 320-331

Krzysztof R. Apt, Howard A. Blair: Arithmetic classification of perfect models of stratified programs. Fundam. Inform. 14(3): 339-343 (1991)

Howard A. Blair, Allen L. Brown Jr.: Definite Clause Programs are Canonical (over a suitable domain). Ann. Math. Artif. Intell. 1: 1-19 (1990)

Feng Yang, Allen L. Brown Jr., Howard A. Blair: Programming in Default Logic. LPNMR 1990: 178-186

Howard A. Blair, V. S. Subrahmanian: Paraconsistent Logic Programming. Theor. Comput. Sci. 68(2): 135-154 (1989)

Krzysztof R. Apt, Howard A. Blair, Adrian Walker: Towards a Theory of Declarative Knowledge. Foundations of Deductive Databases and Logic Programming. 1988: 89-148

Krzysztof R. Apt, Howard A. Blair: Arithmetic Classification of Perfect Models of Stratified Programs. ICLP/SLP 1988: 765-779

Howard A. Blair: Metalogic Programming and Direct Universal Computability. META 1988: 53-63

Howard A. Blair, V. S. Subrahmanian: Paraconsistent Logic Programming. FSTTCS 1987: 340-360

Howard A. Blair: Canoncical Conservative Extensions of Logic Program Completions. SLP 1987: 154-161

Andrzej Trybulec, Howard A. Blair: Computer Assisted Reasoning with MIZAR. IJCAI 1985: 26-28

Andrzej Trybulec, Howard A. Blair: Computer Aider Reasoning. Logic of Programs 1985: 406-412

Howard A. Blair: The Intractability of Validity in Logic Programming and Dynamic Logic. Logic of Programs 1983: 57-67

Howard A. Blair: The Recursion-Theoretical Complexity of the Semantics of Predicate Logic as a Programming Language. Information and Control 54(1/2): 25-47 (1982)

Howard A. Blair: The Undecidability of Two Completeness Notions for the "Negation as Failure". ICLP 1982: 164-168