Results 1 
9 of
9
Verifying norm consistency in electronic institutions
 In Proceedings of the AAAI04 Workshop on Agent Organizations: Theory and Practice
, 2004
"... Electronic institutions are a formalism to define and analyse protocols among agents with a view to achieving global and individual goals. In this paper we elaborate on the verification of properties of electronic institutions based on the dialogues that agents may hold. Specifically, we provide a c ..."
Abstract

Cited by 26 (9 self)
 Add to MetaCart
(Show Context)
Electronic institutions are a formalism to define and analyse protocols among agents with a view to achieving global and individual goals. In this paper we elaborate on the verification of properties of electronic institutions based on the dialogues that agents may hold. Specifically, we provide a computational approach to assess whether an electronic institution is normatively consistent. In this manner, given an electronic institution we can determine whether its norms prevent normcompliant executions from happening. For this we strongly rely on the analysis of the dialogues that may occur as agents interact by exchanging illocutions in an electronic institution. 1.
Handlers of Algebraic Effects
"... Abstract. We present an algebraic treatment of exception handlers and, more generally, introduce handlers for other computational effects representable by an algebraic theory. These include nondeterminism, interactive input/output, concurrency, state, time, and their combinations; in all cases the c ..."
Abstract

Cited by 24 (1 self)
 Add to MetaCart
(Show Context)
Abstract. We present an algebraic treatment of exception handlers and, more generally, introduce handlers for other computational effects representable by an algebraic theory. These include nondeterminism, interactive input/output, concurrency, state, time, and their combinations; in all cases the computation monad is the freemodel monad of the theory. Each such handler corresponds to a model of the theory for the effects at hand. The handling construct, which applies a handler to a computation, is based on the one introduced by Benton and Kennedy, and is interpreted using the homomorphism induced by the universal property of the free model. This general construct can be used to describe previously unrelated concepts from both theory and practice. 1
Logicbased electronic institutions
 In this volume
, 2003
"... Abstract. We propose a logicbased rendition of electronic institutions – these are means to specify open agent organisations. We employ a simple notation based on firstorder logic and set theory to represent an expressive class of electronic institutions. We also provide a formal semantics for our ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
(Show Context)
Abstract. We propose a logicbased rendition of electronic institutions – these are means to specify open agent organisations. We employ a simple notation based on firstorder logic and set theory to represent an expressive class of electronic institutions. We also provide a formal semantics for our constructs and present a distributed implementation of a platform to enact electronic institutions specified in our formalism. 1
On the Brightness of the Thomson Lamp. A Prolegomenon to Quantum Recursion Theory
, 2009
"... Some physical aspects related to the limit operations of the Thomson lamp are discussed. Regardless of the formally unbounded and even infinite number of “steps” involved, the physical limit has an operational meaning in agreement with the Abel sums of infinite series. The formal analogies to accele ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
(Show Context)
Some physical aspects related to the limit operations of the Thomson lamp are discussed. Regardless of the formally unbounded and even infinite number of “steps” involved, the physical limit has an operational meaning in agreement with the Abel sums of infinite series. The formal analogies to accelerated (hyper) computers and the recursion theoretic diagonal methods are discussed. As quantum information is not bound by the mutually exclusive states of classical bits, it allows a consistent representation of fixed point states of the diagonal operator. In an effort to reconstruct the selfcontradictory feature of diagonalization, a generalized diagonal method allowing no quantum fixed points is proposed.
The diagonalization method in quantum recursion theory
, 2009
"... As quantum parallelism allows the effective corepresentation of classical mutually exclusive states, the diagonalization method of classical recursion theory has to be modified. Quantum diagonalization involves unitary operators whose eigenvalues are different from one. ..."
Abstract
 Add to MetaCart
As quantum parallelism allows the effective corepresentation of classical mutually exclusive states, the diagonalization method of classical recursion theory has to be modified. Quantum diagonalization involves unitary operators whose eigenvalues are different from one.
PrediCalc: a logical spreadsheet management system
"... In this article, we describe PrediCalc, a logical spreadsheet that allows for manytomany constraints and propagation in all directions. We explain PrediCalc’s update mechanism and PrediCalc’s unique approach to handling inconsistencies between the spreadsheet values and the spreadsheet formulas. W ..."
Abstract
 Add to MetaCart
(Show Context)
In this article, we describe PrediCalc, a logical spreadsheet that allows for manytomany constraints and propagation in all directions. We explain PrediCalc’s update mechanism and PrediCalc’s unique approach to handling inconsistencies between the spreadsheet values and the spreadsheet formulas. We have developed a paraconsistent entailment relation for the purpose of computing the consequences of PrediCalc’s value assignments under inconsistency. We close with thoughts on the prospects of logical spreadsheets on the World Wide Web, and describe our initial Websheet prototypes. 1
Compatible and Incompatible Ontology Mappings
"... Abstract. Upper ontologies are interesting because describing and representing concepts that can be used across various domains (as opposed to domain ontologies). This feature may enable increased correctness of mappings between domain ontologies, conceptual schema and languages. Unfortunately, ther ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. Upper ontologies are interesting because describing and representing concepts that can be used across various domains (as opposed to domain ontologies). This feature may enable increased correctness of mappings between domain ontologies, conceptual schema and languages. Unfortunately, there exist various upper ontologies and it is quite difficult to decide or to assess which of them should be used in one application: the main reason is that upper ontologies are complex artifacts possibly specified in specific logics providing formalization of highly abstract concepts. Researchers have been therefore interested in understanding the similarities between upper ontologies by establishing mappings between key ontology concepts. In this paper, we review mappings proposed in literature and we establish a notion of compatibility between these mappings by introducing a method based on Galois connections. We then conclude with a synthesis of the results obtained by using the proposed method. The key findings put in evidence some key differences leading to incompatibility among proposed mappings. These differences are worth to be further investigated.
Scalable Offline Monitoring?
"... Abstract. We propose an approach to monitoring IT systems offline, where system actions are logged in a distributed file system and subsequently checked for compliance against policies formulated in an expressive temporal logic. The novelty of our approach is that monitoring is parallelized so tha ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract. We propose an approach to monitoring IT systems offline, where system actions are logged in a distributed file system and subsequently checked for compliance against policies formulated in an expressive temporal logic. The novelty of our approach is that monitoring is parallelized so that it scales to large logs. Our technical contributions comprise a formal framework for slicing logs, an algorithmic realization based on MapReduce, and a highperformance implementation. We evaluate our approach analytically and experimentally, proving the soundness and completeness of our slicing techniques and demonstrating its practical feasibility and efficiency on realworld logs with 400 GB of relevant data. 1
Noname manuscript No. (will be inserted by the editor) Sentence complexity of theorems in Mizar
"... Abstract As one of the longestrunning computerassisted formal mathematics projects, large tracts of mathematical knowledge have been formalized with the help of the Mizar system. Because Mizar is based on firstorder classical logic and set theory, and because of its emphasis on pure mathematics, ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract As one of the longestrunning computerassisted formal mathematics projects, large tracts of mathematical knowledge have been formalized with the help of the Mizar system. Because Mizar is based on firstorder classical logic and set theory, and because of its emphasis on pure mathematics, the Mizar library offers a cornucopia for the researcher interested in foundations of mathematics. With Mizar, one can adopt an experimental approach and take on problems in foundations, at least those which are amenable to such experimentation. Addressing a question posed by H. Friedman, we use Mizar to take on the question of surveying the sentence complexity (measured by quantifier alternation) of mathematical theorems. We find, as Friedman suggests, that the sentence complexity of most Mizar theorems is universal (Π1, or ∀), and as one goes higher in the sentence complexity hierarchy the number of Mizar theorems having these complexities decreases rapidly. The results support the intuitive idea that mathematical statements, even when carried out an abstract settheoretical style, are usually quite low in the sentence complexity hierarchy (not more complex than ∀∃ ∀ or ∃∀.) Keywords proof checking · firstorder logic · set theory · foundations of mathematics 1