Results 1  10
of
29
Possible Worlds and Resources: The Semantics of BI
 THEORETICAL COMPUTER SCIENCE
, 2003
"... The logic of bunched implications, BI, is a substructural system which freely combines an additive (intuitionistic) and a multiplicative (linear) implication via bunches (contexts with two combining operations, one which admits Weakening and Contraction and one which does not). BI may be seen to a ..."
Abstract

Cited by 50 (18 self)
 Add to MetaCart
The logic of bunched implications, BI, is a substructural system which freely combines an additive (intuitionistic) and a multiplicative (linear) implication via bunches (contexts with two combining operations, one which admits Weakening and Contraction and one which does not). BI may be seen to arise from two main perspectives. On the one hand, from prooftheoretic or categorical concerns and, on the other, from a possibleworlds semantics based on preordered (commutative) monoids. This semantics may be motivated from a basic model of the notion of resource. We explain BI's prooftheoretic, categorical and semantic origins. We discuss in detail the question of completeness, explaining the essential distinction between BI with and without ? (the unit of _). We give an extensive discussion of BI as a semantically based logic of resources, giving concrete models based on Petri nets, ambients, computer memory, logic programming, and money.
Application of Linear Logic to Web Service Composition
 In The First International Conference on Web Services, Las Vegas
, 2003
"... Abstract In this paper, we propose a method for automated web service composition by applying Linear Logic (LL) theorem proving. We distinguish valueadded web services and core service by assuming that the core service is already selected by the user, but its functionality does not completely match ..."
Abstract

Cited by 27 (4 self)
 Add to MetaCart
(Show Context)
Abstract In this paper, we propose a method for automated web service composition by applying Linear Logic (LL) theorem proving. We distinguish valueadded web services and core service by assuming that the core service is already selected by the user, but its functionality does not completely match the user’s requirement. Our method enables automation for combining the core service together with a set of valueadded services to solve the problem. The method uses web service languages for external presentation of atomic web services (WSDL) or composite web services (BPEL4WS), while the services are internally presented by extralogical axioms and proofs in LL. In this paper, we are focused on the internal presentation and proof. LL, as the internal representation language, enables us to define some issues required by web service composition formally, such as qualitative and quantitative constraints plus subsumption reasoning on concepts. In addition, LL guarantees the correctness and completeness of service composition process.
The Semantics of BI and Resource Tableaux
 UNDER CONSIDERATION FOR PUBLICATION IN MATH. STRUCT. IN COMP. SCIENCE
, 2005
"... The logic of bunched implications, BI, provides a logical analysis of a basic notion of resource rich enough, for example, to form the logical basis for “pointer logic ” and “separation logic” semantics for programs which manipulate mutable data structures. We develop a theory of semantic tableaux f ..."
Abstract

Cited by 17 (2 self)
 Add to MetaCart
The logic of bunched implications, BI, provides a logical analysis of a basic notion of resource rich enough, for example, to form the logical basis for “pointer logic ” and “separation logic” semantics for programs which manipulate mutable data structures. We develop a theory of semantic tableaux for BI, so providing an elegant basis for efficient theorem proving tools for BI. It is based on the use of an algebra of labels for BI’s tableaux to solve the resourcedistribution problem, the labels being the elements of resource models. For BI with inconsistency, , the challenge consists in dealing with BI’s Grothendieck topological models within such a proofsearch method, based on labels. We prove soundness and completeness theorems for a resource tableaux method TBI with respect to this semantics and provide a way to build countermodels from socalled dependency graphs. Then, from these results, we can define a new resource semantics of BI, based on partially defined monoids, and prove that this semantics is complete. Such a semantics, based on partiality, is closely related to the semantics of BI’s (intuitionistic) pointer and separation logics. Returning to the tableaux calculus, we propose a new version with liberalized rules for which the countermodels are closely related to the topological Kripke semantics of BI. As consequences of the relationships between semantics of BI and resource tableaux, we prove two strong new results for propositional BI: its decidability and the finite model property with respect to topological semantics.
On the computational complexity of cutelimination in linear logic
 In Proceedings of ICTCS 2003, volume 2841 of LNCS
, 2003
"... Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cutelimination problem (CEP) is to decide whether these proofs reduce to the same normal form. This decision problem has been shown to be ptimecomplete for Multiplicative Linear Logic (Mairson 2003). The ..."
Abstract

Cited by 13 (0 self)
 Add to MetaCart
(Show Context)
Abstract. Given two proofs in a logical system with a confluent cutelimination procedure, the cutelimination problem (CEP) is to decide whether these proofs reduce to the same normal form. This decision problem has been shown to be ptimecomplete for Multiplicative Linear Logic (Mairson 2003). The latter result depends upon a restricted simulation of weakening and contraction for boolean values in MLL; in this paper, we analyze how and when this technique can be generalized to other MLL formulas, and then consider CEP for other subsystems of Linear Logic. We also show that while additives play the role of nondeterminism in cutelimination, they are not needed to express deterministic ptime computation. As a consequence, affine features are irrelevant to expressing ptime computation. In particular, Multiplicative Light Linear Logic (MLLL) and Multiplicative Soft Linear Logic (MSLL) capture ptime even without additives nor unrestricted weakening. We establish hierarchical results on the cutelimination problem for MLL(ptimecomplete), MALL(coNPcomplete), MSLL(EXPTIMEcomplete), and for MLLL (2EXPTIMEcomplete). 1
Decidability and Finite Model Property of Substructural Logics
 In The Tbilisi Symposium on Logic, Language and Computation
, 1998
"... this paper, we will give a short survey of results on decision problems and the finite model property of substructural logics. The paper is far from a complete list of these results, since a lot of results have been obtained already in some restricted classes of substructural logics, like relevant l ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
(Show Context)
this paper, we will give a short survey of results on decision problems and the finite model property of substructural logics. The paper is far from a complete list of these results, since a lot of results have been obtained already in some restricted classes of substructural logics, like relevant logics, and therefore it is impossible to cover all of them. ( As for surveys of decision problems and the finite model property of relevant logics, see e.g. [1, 2, 7]. Also, see [16] for a survey of decision problems of logics related to linear logic. ) Our aim of the present paper is to try to compare results from different classes of substructural logics with each other and discuss them as a whole, in order to get a perspective of them.
Parsing mell proof nets
 In TLCA
, 1997
"... We propose a new formulation for full (weakening and constants included) multiplicative and exponential (MELL) proof nets, allowing a complete set of rewriting rules to parse them. The recognizing grammar de ned by such a rewriting system (con uent and strong normalizing on the new proof nets) gives ..."
Abstract

Cited by 8 (3 self)
 Add to MetaCart
We propose a new formulation for full (weakening and constants included) multiplicative and exponential (MELL) proof nets, allowing a complete set of rewriting rules to parse them. The recognizing grammar de ned by such a rewriting system (con uent and strong normalizing on the new proof nets) gives a correctness criterion that we show equivalent to the DanosRegnier one. 1
Modelling combinatorial auctions in linear logic
 in Proc. 12th International Conference on the Principles of Knowledge Representation and Reasoning (KR2010
, 2010
"... We show that linear logic can serve as an expressive framework in which to model a rich variety of combinatorial auction mechanisms. Due to its resourcesensitive nature, linear logic can easily represent bids in combinatorial auctions in which goods may be sold in multiple units, and we show how it ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
(Show Context)
We show that linear logic can serve as an expressive framework in which to model a rich variety of combinatorial auction mechanisms. Due to its resourcesensitive nature, linear logic can easily represent bids in combinatorial auctions in which goods may be sold in multiple units, and we show how it naturally generalises several bidding languages familiar from the literature. Moreover, the winner determination problem, i.e., the problem of computing an allocation of goods to bidders producing a certain amount of revenue for the auctioneer, can be modelled as the problem of finding a proof for a particular linear logic sequent.
Resource Tableaux (Extended Abstract)
 In Proc. CSL 2002, Edinburgh, volume 2471 of LNCS
, 2002
"... The logic of bunched implications, BI, provides a logical analysis of a basic notion of resource rich enough to provide a "pointer logic" semantics for programs which manipulate mutable data structures. We develop a theory of semantic tableaux for BI, so providing an elegant basis for e ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
The logic of bunched implications, BI, provides a logical analysis of a basic notion of resource rich enough to provide a "pointer logic" semantics for programs which manipulate mutable data structures. We develop a theory of semantic tableaux for BI, so providing an elegant basis for efficient theorem proving tools for BI. It is based on the use of an algebra of labels for BI's tableaux to solve the resourcedistribution problem, the labels being the elements of resource models. For BI with inconsistency, ?, the challenge consists in dealing with BI's Grothendieck topological models within such a proofsearch method, based on labels. We prove soundness and completeness theorems for a resource tableaux method TBI with respect to this semantics and provide a way to build countermodels from socalled dependency graphs. As consequences, we have two strong new results for BI: the decidability of propositional BI and the finite model property with respect to Grothendieck topological semantics. In addition, we propose, by considering partially defined monoids, a new semantics which generalizes the semantics of BI's pointer logic and for which BI is complete Keywords: BI; resources; semantics; tableaux; decidability; finite model property.
Linear Logic, Partial Deduction and Cooperative Problem Solving
 in Proceedings of the First International Workshop on Declarative Agent Languages and Technologies, DALT 2003
, 2003
"... In this paper we present a model of cooperative problem solving (CPS). Linear Logic (LL) is used for encoding agents' states, goals and capabilities. LL theorem proving is applied by each agent to determine whether the particular agent is capable of solving the problem alone. If no individu ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
In this paper we present a model of cooperative problem solving (CPS). Linear Logic (LL) is used for encoding agents' states, goals and capabilities. LL theorem proving is applied by each agent to determine whether the particular agent is capable of solving the problem alone. If no individual solution can be constructed, then the agent may start negotiation with other agents in order to nd a cooperative solution.
Model Checking Linear Logic Specifications
, 2003
"... The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications. The fragment of linear logic we consider in this paper is based on the linear logic programming language called LO (Andreoli and Pareschi 1 ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
The overall goal of this paper is to investigate the theoretical foundations of algorithmic verification techniques for first order linear logic specifications. The fragment of linear logic we consider in this paper is based on the linear logic programming language called LO (Andreoli and Pareschi 1990) enriched with universally quantified goal formulas. Although LO was originally introduced as a theoretical foundation for extensions of logic programming languages, it can also be viewed as a very general language to specify a wide range of infinitestate concurrent systems (Andreoli 1992; Cervesato 1995). Our approach is based on the relation between backward reachability and provability highlighted in our previous work on propositional LO programs (Bozzano et al. 2002). Following this line of research, we define here a general framework for the bottomup evaluation of first order linear logic specifications. The evaluation procedure is based on an effective fixpoint operator working on a symbolic representation of infinite collections of first order linear logic formulas. The theory of well quasiorderings (Abdulla et al. 1996; Finkel and Schnoebelen 2001) can be used to provide sufficient conditions for the termination of the evaluation of non trivial fragments of first order linear logic.