Results 1  10
of
1,169
Temporal and modal logic
 HANDBOOK OF THEORETICAL COMPUTER SCIENCE
, 1995
"... We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic. ..."
Abstract

Cited by 1300 (17 self)
 Add to MetaCart
We give a comprehensive and unifying survey of the theoretical aspects of Temporal and modal logic.
Logical foundations of objectoriented and framebased languages
 JOURNAL OF THE ACM
, 1995
"... We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, ..."
Abstract

Cited by 880 (64 self)
 Add to MetaCart
We propose a novel formalism, called Frame Logic (abbr., Flogic), that accounts in a clean and declarative fashion for most of the structural aspects of objectoriented and framebased languages. These features include object identity, complex objects, inheritance, polymorphic types, query methods, encapsulation, and others. In a sense, Flogic stands in the same relationship to the objectoriented paradigm as classical predicate calculus stands to relational programming. Flogic has a modeltheoretic semantics and a sound and complete resolutionbased proof theory. A small number of fundamental concepts that come from objectoriented programming have direct representation in Flogic; other, secondary aspects of this paradigm are easily modeled as well. The paper also discusses semantic issues pertaining to programming with a deductive objectoriented language based on a subset of Flogic.
A SURVEY OF LIMITED NONDETERMINISM
, 2003
"... Nondeterminism is typically used as an inherent part of the computational models used in computational complexity. However, much work has been done looking at nondeterminism as a separate resource added to deterministic machines. This survey examines several different approaches to limiting the amou ..."
Abstract
 Add to MetaCart
Nondeterminism is typically used as an inherent part of the computational models used in computational complexity. However, much work has been done looking at nondeterminism as a separate resource added to deterministic machines. This survey examines several different approaches to limiting
Categorial Type Logics
 Handbook of Logic and Language
, 1997
"... Contents 1 Introduction: grammatical reasoning 1 2 Linguistic inference: the Lambek systems 5 2.1 Modelinggrammaticalcomposition ............................ 5 2.2 Gentzen calculus, cut elimination and decidability . . . . . . . . . . . . . . . . . . . . 9 2.3 Discussion: options for resource mana ..."
Abstract

Cited by 299 (6 self)
 Add to MetaCart
Contents 1 Introduction: grammatical reasoning 1 2 Linguistic inference: the Lambek systems 5 2.1 Modelinggrammaticalcomposition ............................ 5 2.2 Gentzen calculus, cut elimination and decidability . . . . . . . . . . . . . . . . . . . . 9 2.3 Discussion: options for resource
Turning Nondeterminism into Parallelism
"... Nondeterminism is a useful and prevalent concept in the design and implementation of software systems. An important property of nondeterminism is its latent parallelism: A nondeterministic action can evaluate to multiple behaviors. If at least one of these behaviors does not conflict with concurrent ..."
Abstract
 Add to MetaCart
Nondeterminism is a useful and prevalent concept in the design and implementation of software systems. An important property of nondeterminism is its latent parallelism: A nondeterministic action can evaluate to multiple behaviors. If at least one of these behaviors does not conflict
Nondeterminism, Fairness and a Fundamental Analogy
"... In this note we propose a model for unbounded nondeterministic computation which provides a very natural basis for the structural analogy between recursive function theory and computational complexity theory: P : NP ΒΈ = REC : RE At the same time this model presents an alternative version of the ha ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
reduction, simplicity, immunity, the arithmetical hierarchy, relativizations etc. were all first defined in recursive function theory and later (relativizations of) these notions were introduced in complexity theory. All of this work was inspired by the frustration originating from the difficulty
Selectivity: Reductions, Nondeterminism, and Function Classes
, 1993
"... A set is Pselective [Se179] if there is a polynomialtime semidecision algorithm or the setan algorithm that given any two strings decides which is "more likely" to be in the set. This paper studies two natural generalizations o Pselectivity: the NPselective sets and the sets reducib ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
reducible or equivalent to Pselective sets via polynomialtime reductions. We establish a strict hierarchy among the various reductions and equivalences to Pselective sets. We show that the NPselective sets are in (NP coNP)/poly, are extended low, and (those in NP) are Low2; we also show that NP
Relativization: A revisionistic retrospective
 Bulletin of the EATCS
, 1992
"... In this column we examine the role of relativization in complexity theory in light of recent nonrelativizing results involving interactive protocols. We begin with the twicetold tale of the relativization principle and ponder upon its possible demise. Then, we discuss whether usual assumptions are ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
In this column we examine the role of relativization in complexity theory in light of recent nonrelativizing results involving interactive protocols. We begin with the twicetold tale of the relativization principle and ponder upon its possible demise. Then, we discuss whether usual assumptions
Results 1  10
of
1,169