Results 1  10
of
32,154
Proof Theoretic Complexity
 IN PROOF AND SYSTEM RELIABILITY, H. SCHWICHTENBERG AND R. STEINBRÜGGEN, EDS. NATO SCIENCE SERIES
, 2002
"... A weak formal theory of arithmetic is developed, entirely analogous to classical arithmetic but with two separate kinds of variables: induction variables and quantifier variables. The point is that the provably recursive functions are now more feasibly computable than in the classical case, lying be ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
between Grzegorczyk's E² and E³, and their computational complexity can be characterized in terms of the logical complexity of their termination proofs. Previous results of Leivant are reworked and extended in this new setting, with quite di#erent proof theoretic methods.
The knowledge complexity of interactive proof systems

, 1989
"... Usually, a proof of a theorem contains more knowledge than the mere fact that the theorem is true. For instance, to prove that a graph is Hamiltonian it suffices to exhibit a Hamiltonian tour in it; however, this seems to contain more knowledge than the single bit Hamiltonian/nonHamiltonian. In th ..."
Abstract

Cited by 1246 (39 self)
 Add to MetaCart
/nonHamiltonian. In this paper a computational complexity theory of the "knowledge " contained in a proof is developed. Zeroknowledge proofs are defined as those proofs that convey no additional knowledge other than the correctness of the proposition in question. Examples of zeroknowledge proof systems are given
Master’s Internship XPathlike query logics: a proof theoretical complexity analysis Advisors and location
"... Context XPath is a widely employed language for selecting XML elements. The two main computational problems associated with XPath are querying: given an XML document and an XPath query, return the set of nodes selected by the query; satisfiability: given an XPath query (and optionally a schema for t ..."
Abstract
 Add to MetaCart
Context XPath is a widely employed language for selecting XML elements. The two main computational problems associated with XPath are querying: given an XML document and an XPath query, return the set of nodes selected by the query; satisfiability: given an XPath query (and optionally a schema for the kind of XML documents we want to consider), does there exist an XML document on which this query would select at least one node? Both problems have been studied in depth for many fragments of XPath [1]. When considering queries without data tests, these problems can be tackled using tree automata techniques, and we are on welltrodden grounds. Adding data tests, i.e. the ability to check whether two attributes of two XML elements are the same or not, complicates matters considerably. Nevertheless, several results already give a good picture: • XPath queries can be resolved in linear time (in the document size) for a
Quantum complexity theory
 in Proc. 25th Annual ACM Symposium on Theory of Computing, ACM
, 1993
"... Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97–117]. This constructi ..."
Abstract

Cited by 574 (5 self)
 Add to MetaCart
Abstract. In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s model of a quantum Turing machine (QTM) [Proc. Roy. Soc. London Ser. A, 400 (1985), pp. 97
The complexity of theoremproving procedures
 IN STOC
, 1971
"... It is shown that any recognition problem solved by a polynomial timebounded nondeterministic Turing machine can be “reduced” to the problem of determining whether a given propositional formula is a tautology. Here “reduced ” means, roughly speaking, that the first problem can be solved deterministi ..."
Abstract

Cited by 1050 (5 self)
 Add to MetaCart
of two given graphs is isomorphic to a subgraph of the second. Other examples are discussed. A method of measuring the complexity of proof procedures for the predicate calculus is introduced and discussed. Throughout this paper, a set of strings 1 means a set of strings on some fixed, large, finite
Entity Authentication and Key Distribution
, 1993
"... Entity authentication and key distribution are central cryptographic problems in distributed computing  but up until now, they have lacked even a meaningful definition. One consequence is that incorrect and inefficient protocols have proliferated. This paper provides the first treatment of these p ..."
Abstract

Cited by 578 (13 self)
 Add to MetaCart
of these problems in the complexitytheoretic framework of modern cryptography. Addressed in detail are two problems of the symmetric, twoparty setting: mutual authentication and authenticated key exchange. For each we present a definition, protocol, and proof that the protocol meets its goal, assuming
AgentSpeak(L): BDI Agents speak out in a logical computable language
, 1996
"... BeliefDesireIntention (BDI) agents have been investigated by many researchers from both a theoretical specification perspective and a practical design perspective. However, there still remains a large gap between theory and practice. The main reason for this has been the complexity of theoremprov ..."
Abstract

Cited by 514 (2 self)
 Add to MetaCart
BeliefDesireIntention (BDI) agents have been investigated by many researchers from both a theoretical specification perspective and a practical design perspective. However, there still remains a large gap between theory and practice. The main reason for this has been the complexity of theorem
The Semantics of Predicate Logic as a Programming Language
 JOURNAL OF THE ACM
, 1976
"... Sentences in firstorder predicate logic can be usefully interpreted as programs In this paper the operational and fixpoint semantics of predicate logic programs are defined, and the connections with the proof theory and model theory of logic are investigated It is concluded that operational seman ..."
Abstract

Cited by 808 (18 self)
 Add to MetaCart
semantics is a part of proof theory and that fixpoint semantics is a special case of modeltheoretic semantics.
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 876 (65 self)
 Add to MetaCart
, 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
Results 1  10
of
32,154