Results 1  10
of
674
Automated reasoning in Kleene algebra
 CADE 2007, LNCS 4603
, 2007
"... Abstract. It has often been claimed that model checking, special purpose automated deduction or interactive theorem proving are needed for formal program development. We demonstrate that offtheshelf automated proof and counterexample search is an interesting alternative if combined with the right ..."
Abstract

Cited by 26 (11 self)
 Add to MetaCart
domain model. We implement variants of Kleene algebras axiomatically in Prover9/Mace4 and perform proof experiments about Hoare, dynamic, temporal logics, concurrency control and termination analysis. They confirm that a simple automated analysis of some important program properties is possible
ANL/MCSTM264 Mace4 Reference Manual and Guide
, 2003
"... United States Government and operated by The University of Chicago under the provisions of a contract with the Department of Energy. DISCLAIMER ..."
Abstract
 Add to MetaCart
United States Government and operated by The University of Chicago under the provisions of a contract with the Department of Energy. DISCLAIMER
HAIL: A HighAvailability and Integrity Layer for Cloud Storage
, 2009
"... We introduce HAIL (HighAvailability and Integrity Layer), a distributed cryptographic system that permits a set of servers to prove to a client that a stored file is intact and retrievable. HAIL strengthens, formally unifies, and streamlines distinct approaches from the cryptographic and distribute ..."
Abstract

Cited by 194 (4 self)
 Add to MetaCart
We introduce HAIL (HighAvailability and Integrity Layer), a distributed cryptographic system that permits a set of servers to prove to a client that a stored file is intact and retrievable. HAIL strengthens, formally unifies, and streamlines distinct approaches from the cryptographic and distributedsystems communities. Proofs in HAIL are efficiently computable by servers and highly compact— typically tens or hundreds of bytes, irrespective of file size. HAIL cryptographically verifies and reactively reallocates file shares. It is robust against an active, mobile adversary, i.e., one that may progressively corrupt the full set of servers. We propose a strong, formal adversarial model for HAIL, and rigorous analysis and parameter choices. We show how HAIL improves on the security and efficiency of existing tools, like Proofs of Retrievability (PORs) deployed on individual servers. We also report on a prototype implementation. 1
Representation and Inference for Natural language  A First Course in . . .
, 1999
"... 3.672> X with the complex term 1 + 1, not with 2, which, for people unused to Prolog's little ways, tends to come as a bit of a surprise. If we want to carry out the actual arithmetic involved, we have to explicitly force evaluation by making use of the very special inbuilt `operator' ..."
Abstract

Cited by 102 (11 self)
 Add to MetaCart
3.672> X with the complex term 1 + 1, not with 2, which, for people unused to Prolog's little ways, tends to come as a bit of a surprise. If we want to carry out the actual arithmetic involved, we have to explicitly force evaluation by making use of the very special inbuilt `operator' is/2. This calls an inbuilt mechanism which carries out the arithmetic evaluation of its second argument, and then unication plays no role here!). On the other hand, \== checks whether its argument are not identical. Arithmetic Prolog contains some builtin operators for handling integer arithmetic. These include *, / +,  (for multiplication, division, addition, and subtraction, respectively) and >, < for comparing numbers. These symbols, however, are just ordinary Prolog operators. That is, they are just a user friendly notation for writing
Dedication Preamble Russellian Descriptions Gibbardian Indicatives References Dedication Preamble Russellian Descriptions Gibbardian Indicatives References
"... Bill McCune was one of the true pioneers of automated reasoning. The systems Otter [6], Mace, [7] and Prover9 [4] were masterfully implemented (almost entirely) by Bill. Bill’s program Eqp [5] (a predecessor of Prover9) discovered the first proof of the Robbins Conjecture [8]. He was awarded the 200 ..."
Abstract
 Add to MetaCart
Bill McCune was one of the true pioneers of automated reasoning. The systems Otter [6], Mace, [7] and Prover9 [4] were masterfully implemented (almost entirely) by Bill. Bill’s program Eqp [5] (a predecessor of Prover9) discovered the first proof of the Robbins Conjecture [8]. He was awarded
SEM: A System for Enumerating Models
 Department of Philosophy University of WisconsinMadison Mathematics and Computer Science
, 1995
"... Model generation can be regarded as a special case of the Constraint Satisfaction Problem (CSP). It has many applications in AI, computer science and mathematics. In this paper, we describe SEM, a System for Enumerating finite Models of firstorder manysorted theories. To the best of our knowledge, ..."
Abstract

Cited by 79 (3 self)
 Add to MetaCart
Model generation can be regarded as a special case of the Constraint Satisfaction Problem (CSP). It has many applications in AI, computer science and mathematics. In this paper, we describe SEM, a System for Enumerating finite Models of firstorder manysorted theories. To the best of our knowledge, SEM outperforms any other finite model generation system on many test problems. The high performance of SEM relies on the following two techniques: (a) an efficient implementation of constraint propagation which requires little dynamic allocation of storage; (b) a powerful heuristic which eliminates many isomorphic partial models during the search. We will present the basic algorithm of SEM along with these two techniques. Our experimental results show that general purpose finite model generators are indeed useful in many applications. 1
System Description: IVY
 In Proc. 17th CADE, LNAI 1831
, 2000
"... . IVY is a verified theorem prover for firstorder logic with equality. It is coded in ACL2, and it makes calls to the theorem prover Otter to search for proofs and to the program MACE to search for countermodels. Verifications of Otter and MACE are not practical because they are coded in C. Ins ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
. IVY is a verified theorem prover for firstorder logic with equality. It is coded in ACL2, and it makes calls to the theorem prover Otter to search for proofs and to the program MACE to search for countermodels. Verifications of Otter and MACE are not practical because they are coded in C
DIPPER: Description and Formalisation of an InformationState Update Dialogue System Architecture
 In 4th SIGdial Workshop on Discourse and Dialogue
, 2003
"... The DIPPER architecture is a collection of software agents for prototyping spoken dialogue systems. Implemented on top of the Open Agent Architecture (OAA), it comprises agents for speech input and output, dialogue management, and further supporting agents. We define a formal syntax and semantics fo ..."
Abstract

Cited by 74 (17 self)
 Add to MetaCart
The DIPPER architecture is a collection of software agents for prototyping spoken dialogue systems. Implemented on top of the Open Agent Architecture (OAA), it comprises agents for speech input and output, dialogue management, and further supporting agents. We define a formal syntax and semantics for the DIPPER information state update language. The language is independent...
On the Notion of Interestingness in Automated Mathematical Discovery
 International Journal of Human Computer Studies
, 2000
"... We survey ve mathematical discovery programs by looking in detail at the discovery processes they illustrate and the success they've had. We focus on how they estimate the interestingness of concepts and conjectures and extract some common notions about interestingness in automated mathema ..."
Abstract

Cited by 70 (26 self)
 Add to MetaCart
We survey ve mathematical discovery programs by looking in detail at the discovery processes they illustrate and the success they've had. We focus on how they estimate the interestingness of concepts and conjectures and extract some common notions about interestingness in automated mathematical discovery. We detail how empirical evidence is used to give plausibility to conjectures, and the dierent ways in which a result can be thought of as novel. We also look at the ways in which the programs assess how surprising and complex a conjecture statement is, and the dierent ways in which the applicability of a concept or conjecture is used. Finally, we note how a user can set tasks for the program to achieve and how this aects the calculation of interestingness. We conclude with some hints on the use of interestingness measures for future developers of discovery programs in mathematics.
The Logical Modelling of Computational MultiAgent Systems
, 1992
"... THE aim of this thesis is to investigate logical formalisms for describing, reasoning about, specifying, and perhaps ultimately verifying the properties of systems composed of multiple intelligent computational agents. There are two obvious resources available for this task. The first is the (largel ..."
Abstract

Cited by 70 (17 self)
 Add to MetaCart
THE aim of this thesis is to investigate logical formalisms for describing, reasoning about, specifying, and perhaps ultimately verifying the properties of systems composed of multiple intelligent computational agents. There are two obvious resources available for this task. The first is the (largely AI) tradition of reasoning about the intentional notions (belief, desire, etc.). The second is the (mainstream computer science) tradition of temporal logics for reasoning about reactive systems. Unfortunately, neither resource is ideally suited to the task: most intentional logics have little to say on the subject of agent architecture, and tend to assume that agents are perfect reasoners, whereas models of concurrent systems from mainstream computer science typically deal with the execution of individual program instructions. This thesis proposes a solution which draws upon both resources. It defines a model of agents and multiagent systems, and then defines two execution models, which ...
Results 1  10
of
674