Results 1 
4 of
4
Knowledgebased synthesis of distributed systems using event structures
 In Proc. 11th Int. Conf. on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2004), Lecture Notes in Computer Science
, 2005
"... To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification exists. This process is particularly effective if the specifications are written in a highlevel language that makes it easy for de ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification exists. This process is particularly effective if the specifications are written in a highlevel language that makes it easy for designers to specify their goals. We consider a highlevel specification language that results from adding knowledge to a fragment of Nuprl specifically tailored for specifying distributed protocols, called event theory. We then show how highlevel knowledgebased programs can be synthesized from the knowledgebased specifications using a proof development system such as Nuprl. Methods of Halpern and Zuck [1992] then apply to convert these knowledgebased protocols to ordinary protocols. These methods can be expressed as heuristic transformation tactics in Nuprl. 1
Abstraction and Ontology: Questions as Propositional Abstracts in Type Theory with Records. Journal of Logic and Computation
 KnowledgeBased Systems 15: 265–273 Joshi, A.K. (1983) Varieties of Cooperative Responses in QuestionAnswer Systems
, 2005
"... The paper develops a semantics for natural language interrogatives which identifies questions— the denotations of interrogatives—with propositional abstracts. The paper argues that a theory of Questions as Propositional Abstracts (QPA), is a simple, transparently implementable theory that has signif ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The paper develops a semantics for natural language interrogatives which identifies questions— the denotations of interrogatives—with propositional abstracts. The paper argues that a theory of Questions as Propositional Abstracts (QPA), is a simple, transparently implementable theory that has significant empirical coverage. However, until recently QPA has been abandoned in formal semantic treatments of questions, due to a number of significant problems QPA encountered when formulated within the type system of Montague Semantics. In recent work, Ginzburg and Sag provided a a situation theoretic implementation of QPA that succeeded in overcoming cerain of the original problems for QPA. However, Ginzburg and Sag’s proposal relied on a special purpose account of λabstraction, raising the question to what extent QPA can be sustained using standard notions of abstraction. In this paper such doubts are allayed by implementing QPA in a version of Type Theory that provides record types. These latter allow one to develop notions of simultaneous/vacuous abstraction with restrictions and an ontology with various ‘informational entities’. Moreover, the intrinsic polymorphism of this theory plays a crucial role in enabling the definition of a general type for questions, one of the main stumbling blocks for earlier versions of QPA. 1
λµPRL – A Proof Refinement Calculus for Classical Reasoning
 in Computational Type Theory Diploma thesis, Institut für Informatik, Universität Potsdam
, 2009
"... Abstract. We present a hybrid proof calculus λµPRL that combines the propositional fragment of computational type theory with classical reasoning rules from the λµcalculi. The calculus supports the topdown development of proofs as well as the extraction of proof terms in a functional programming l ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We present a hybrid proof calculus λµPRL that combines the propositional fragment of computational type theory with classical reasoning rules from the λµcalculi. The calculus supports the topdown development of proofs as well as the extraction of proof terms in a functional programming language extended by a nonconstructive binding operator. It enables a user to employ a mix of constructive and classical reasoning techniques and to extract algorithms from proofs of specification theorems that are fully executable if classical arguments occur only in proof parts related to the validation of the algorithm. We prove the calculus sound and complete for classical propositional logic, introduce the concept of µsafe terms to identify proof terms corresponding to constructive proofs and show that the restriction of λµPRL to µsafe proof terms is sound and complete for intuitionistic propositional logic. We also show that an extension of λµPRL to arithmetical and firstorder expressions is isomorphic to Murthy’s calculus P ROGK.
INTEGRATION OF DECISION PROCEDURES INTO HIGHORDER INTERACTIVE PROVERS
, 2006
"... An efficient proof assistant uses a wide range of decision procedures, including automatic verification of validity of arithmetical formulas with linear terms. Since the final product of a proof assistant is a formalized and verified proof, it prompts an additional task of building proofs of formula ..."
Abstract
 Add to MetaCart
An efficient proof assistant uses a wide range of decision procedures, including automatic verification of validity of arithmetical formulas with linear terms. Since the final product of a proof assistant is a formalized and verified proof, it prompts an additional task of building proofs of formulas, which validity is established by such a decision procedure. We present an implementation of several decision procedures for arithmetical formulas with linear terms in the MetaPRL proof assistant in a way that provides formal proofs of formulas found valid by those procedures. We also present an implementation of a theorem prover for the logic of justified common knowledge S4 J n introduced in [Artemov, 2004]. This system captures the notion of justified common knowledge, which is free of some of the deficiencies of the usual common knowledge operator, and is yet sufficient for the analysis of epistemic problems where common knowledge has been traditionally applied. In particular, S4 J n enjoys cutelimination, which introduces the possibility of automatic proof search in the logic of common