Filters








4,021 Hits in 3.8 sec

A Unified Display Proof Theory for Bunched Logic

James Brotherston
2010 Electronical Notes in Theoretical Computer Science  
Our calculi satisfy cut-elimination, and are sound and complete with respect to their standard presentations.  ...  We formulate a unified display calculus proof theory for the four principal varieties of bunched logic by combining display calculi for their component logics.  ...  In computer science, such resource readings of bunched logic have very successfully been exploited to obtain logics for program analysis.  ... 
doi:10.1016/j.entcs.2010.08.012 fatcat:ok6e5wduevcmhjiokif4nfpjvq

Forthcoming Papers

2002 Journal of Logic and Computation  
Recently, it turned out that stratified context unification and one-step rewrite constraints are equivalent.  ...  We introduce intuitionistic and classical substructural logics with structural rules mingle and connective strong negation, and investigate the cut-elimination property and the relevance principle for  ...  The method exploits the strong connection between these deductive relations and conditional logics, and it is based on the usual possible world semantics devised for the latter.  ... 
doi:10.1093/logcom/12.5.911 fatcat:uba4ocmuhrfvrdxxxdgytudoee

Tools for the Investigation of Substructural and Paraconsistent Logics [chapter]

Agata Ciabattoni, Lara Spendier
2014 Lecture Notes in Computer Science  
We present an overview of the methods in [10, 7, 13] and their implementation in the system TINC.  ...  This system introduces analytic calculi for large classes of substructural and paraconsistent logics, which it then uses to prove various results about the formalized logics.  ...  Moreover, the tool exploits the generated calculus by checking a sufficient condition for the standard completeness of the input logic.  ... 
doi:10.1007/978-3-319-11558-0_2 fatcat:ez3itzximrgwxlilpuci5gkgky

Psi-Calculi Revisited: Connectivity and Compositionality [article]

Johannes Åman Pohjola
2020 arXiv   pre-print
In this paper, we give a new operational semantics to psi-calculi that allows us to lift these restrictions and simplify some of the proofs.  ...  Psi-calculi is a parametric framework for process calculi similar to popular pi-calculus extensions such as the explicit fusion calculus, the applied pi-calculus and the spi calculus.  ...  (Section 4.1) • We exploit non-transitive connectivity to show that mixed choice is a derived operator of psi-calculi in a very strong sense: its encoding is fully abstract and satisfies strong operational  ... 
arXiv:1909.06692v4 fatcat:u7oycfxxdjflnc6y4btqn67rd4

Psi-Calculi Revisited: Connectivity and Compositionality

Johannes Åman Pohjola
2019 Logical Methods in Computer Science  
In this paper, we give a new operational semantics to psi-calculi that allows us to lift these restrictions and simplify some of the proofs.  ...  Psi-calculi is a parametric framework for process calculi similar to popular pi-calculus extensions such as the explicit fusion calculus, the applied pi-calculus and the spi calculus.  ...  (Section 4.1) • We exploit non-transitive connectivity to show that mixed choice is a derived operator of psi-calculi in a very strong sense: its encoding is fully abstract and satisfies strong operational  ... 
doi:10.23638/lmcs-16(4:16)2020 fatcat:qbst7xrttbgbtd52cyqsz344ae

A Hierarchy of Modal Event Calculi: Expressiveness and Complexity [chapter]

Iliano Cervesato, Massimo Franceschet, Angelo Montanari
2000 Applied Logic Series  
partial ordering of events (3-/2-MVIs), to the Generalized Modal Event Calculus (GMEC ), that extends MEC by allowing a free mix of boolean connectives and modal operators.  ...  We consider a hierarchy of modal event calculi to represent and reason about partially ordered events.  ...  The following equivalences can be obtained by exploiting the McKinsey formula, 23ϕ → 32ϕ, valid in K1.1 (but not in S4 ). Corollary 9. (Further equivalent GMEC-formulas) Let ϕ be a GMEC-formula.  ... 
doi:10.1007/978-94-015-9586-5_1 fatcat:l4anmbo62jb4ngsufdk5qpcmku

Bunched Logics Displayed

James Brotherston
2012 Studia Logica: An International Journal for Symbolic Logic  
We show how to constrain applications of display-equivalence in our calculi in such a way that an exhaustive proof search need be only finitely branching, and establish a full deduction theorem for the  ...  Our calculi satisfy cut-elimination, and are sound and complete with respect to their standard presentations.  ...  Cut-free proofs in our display calculi enjoy the usual subformula property (cf. Belnap's condition C1).  ... 
doi:10.1007/s11225-012-9449-0 fatcat:je2bcrborvgwxpugcrkph3rc7y

Automated Synthesis of Tableau Calculi [chapter]

Renate A. Schmidt, Dmitry Tishkovsky
2009 Lecture Notes in Computer Science  
This paper presents a method for synthesising sound and complete tableau calculi.  ...  In order to be able to exploit the 'termination through blocking' results in [6] , in this paper, our goal is to produce tableau calculi that satisfy the prerequisites (i) and (ii).  ...  Our future goal is to further reduce human involvement in the development of calculi by finding appropriate automatically verifiable conditions for optimal calculi to be generated.  ... 
doi:10.1007/978-3-642-02716-1_23 fatcat:bag5stmdorg6zorcpq3wrnfjhq

Modular Construction of Cut-free Sequent Calculi for Paraconsistent Logics

Arnon Avron, Beata Konikowska, Anna Zamansky
2012 2012 27th Annual IEEE Symposium on Logic in Computer Science  
logics known as Logics of Formal (In)consistency.  ...  This paper makes a substantial step towards automatization of paraconsistent reasoning by providing a general method for a systematic and modular generation of cut-free calculi for thousands of paraconsistent  ...  Below we show that these characterizations can be exploited for a modular construction of cut-free sequent calculi too. A.  ... 
doi:10.1109/lics.2012.20 dblp:conf/lics/AvronKZ12 fatcat:siegiuf2tfepteyqjifwqrcrme

Proof-Search in Hilbert Calculi

Mauro Ferrari, Camillo Fiorentini, Guido Fiorino
2017 Italian Conference on Theoretical Computer Science  
It is well-known [7] that the standard formalizations of classical and intuitionistic logic based on Hilbert calculi, sequent calculi and natural deduction are equivalent.  ...  This is primarily motivated by the fact that the latters lack the "deep symmetries" of sequent calculi which can be immediately exploited to control and reduce the search space (see, e.g., [2, 3, 6]  ... 
dblp:conf/ictcs/FerrariFF17 fatcat:je5vu6lfjrau7is4xeyykw743i

Model Checking for Nominal Calculi [chapter]

Gian Luigi Ferrari, Ugo Montanari, Emilio Tuosto
2005 Lecture Notes in Computer Science  
The models of nominal calculi have often infinite states, thus making model checking a difficult task. In this note we survey some of the approaches for model checking nominal calculi.  ...  In a  ...  In nominal calculi, redundancy is strictly connected to the concept of active names. A name n is inactive for an agent P if it is not used in the future behaviour of P.  ... 
doi:10.1007/978-3-540-31982-5_1 fatcat:kclgj4xut5dgfkeey6u226nfey

Page 5106 of Mathematical Reviews Vol. , Issue 93i [page]

1993 Mathematical Reviews  
an open theory into connection calculi.  ...  The problem treated in the present paper is how to build in open first-order theories into connection calculi which accept arbitrary formulas, such that their completeness and soundness are pre- served  ... 

Encoding Asynchronous Interactions Using Open Petri Nets [chapter]

Paolo Baldan, Filippo Bonchi, Fabio Gadducci
2009 Lecture Notes in Computer Science  
The encoding preserves strong and weak CCS asynchronous bisimilarities: it thus represents a relevant step in establishing a precise correspondence between asynchronous calculi and (open) Petri nets.  ...  We believe that the tight connection between Petri nets and asynchronous calculi allows for a fruitful "technology transfer".  ...  The papers [30, 31] exploit the encoding to compare the expressiveness of Linda-like calculi with various communication primitives.  ... 
doi:10.1007/978-3-642-04081-8_8 fatcat:d5fbbkhypjaitmjb6bk4os63ty

Automated Synthesis of Tableau Calculi

Renate Schmidt, Dmitry Tishkovsky, Martin Giese
2011 Logical Methods in Computer Science  
This paper presents a method for synthesising sound and complete tableau calculi.  ...  In order to be able to exploit this 'termination through blocking' result from [33] , in this paper, our goal is to synthesise tableau calculi that satisfy the prerequisites (2) and (3) .  ...  In a similar way, the condition (wd3 ′ ) can be checked for the other connectives.  ... 
doi:10.2168/lmcs-7(2:6)2011 fatcat:wcvr7oon3ncjlniwxvvpd436mi

Qualitative reasoning with directional relations

D. Wolter, J.H. Lee
2010 Artificial Intelligence  
Qualitative calculi are defined to capture domain properties in relation operations, granting a relation algebraic approach to reasoning.  ...  In this paper, we dismantle the hope for efficient reasoning about directional information in infinite spatial domains by showing that it is inherently hard to decide consistency of a set of constraints  ...  Now we establish a connection between a point configuration in a plane (the domain of many qualitative spatial calculi) and a uniform oriented matroid.  ... 
doi:10.1016/j.artint.2010.09.004 fatcat:dvanosnzg5evllebwfck6w6zq4
« Previous Showing results 1 — 15 out of 4,021 results