ACM Transactions on Computational Logic最新文献_第7页

On Composing Finite Forests with Modal Logics 用模态逻辑构造有限森林

IF 0.5 4区数学

ACM Transactions on Computational Logic Pub Date : 2022-12-29 DOI: 10.1145/3569954

Bartosz Bednarczyk, Stephane Demri, Raul Fervari, Alessio Mansutti

引用次数: 0

Semantic Analysis of a Linear Temporal Extension of Quantum Logic and Its Dynamic Aspect 量子逻辑线性时间扩展的语义分析及其动态方面

IF 0.5 4区数学

ACM Transactions on Computational Logic Pub Date : 2022-12-16 DOI: 10.1145/3576926

Tsubasa Takagi

引用次数: 0

Testing using CSP Models: Time, Inputs, and Outputs 使用CSP模型进行测试：时间、输入和输出

IF 0.5 4区数学

ACM Transactions on Computational Logic Pub Date : 2022-12-07 DOI: 10.1145/3572837

James Baxter, Ana Cavalcanti, Maciej Gazda, R. Hierons

{"title":"Testing using CSP Models: Time, Inputs, and Outputs","authors":"James Baxter, Ana Cavalcanti, Maciej Gazda, R. Hierons","doi":"10.1145/3572837","DOIUrl":"https://doi.org/10.1145/3572837","url":null,"abstract":"The existing testing theories for CSP cater for verification of interaction patterns (traces) and deadlocks, but not time. We address here refinement and testing based on a dialect of CSP, called tock-CSP, which can capture discrete time properties. This version of CSP has been of widespread interest for decades; recently, it has been given a denotational semantics, and model checking has become possible using a well established tool. Here, we first equip tock-CSP with a novel semantics for testing, which distinguishes input and output events: the standard models of (tock-)CSP do not differentiate them, but for testing this is essential. We then present a new testing theory for timewise refinement, based on novel definitions of test and test execution. Finally, we reconcile refinement and testing by relating timed ioco testing and refinement in tock-CSP with inputs and outputs. With these results, this paper provides, for the first time, a systematic theory that allows both timed testing and timed refinement to be expressed. An important practical consequence is that this ensures that the notion of correctness used by developers guarantees that tests pass when applied to a correct system and, in addition, faults identified during testing correspond to development mistakes.","PeriodicalId":50916,"journal":{"name":"ACM Transactions on Computational Logic","volume":"24 1","pages":"1 - 40"},"PeriodicalIF":0.5,"publicationDate":"2022-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44799242","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Generalizing Parikh’s Criterion for Relevance-Sensitive Belief Revision Parikh关联敏感信念修正准则的推广

IF 0.5 4区数学

ACM Transactions on Computational Logic Pub Date : 2022-11-25 DOI: 10.1145/3572907

T. Aravanis

{"title":"Generalizing Parikh’s Criterion for Relevance-Sensitive Belief Revision","authors":"T. Aravanis","doi":"10.1145/3572907","DOIUrl":"https://doi.org/10.1145/3572907","url":null,"abstract":"Parikh proposed his relevance-sensitive axiom to remedy the weakness of the classical AGM paradigm in addressing relevant change. An insufficiency of Parikh’s criterion, however, is its dependency on the contingent beliefs of a belief set to be revised, since the former only constrains the revision process of splittable theories (i.e., theories that can be divided in mutually disjoint compartments). The case of arbitrary non-splittable belief sets remains out of the scope of Parikh’s approach. On that premise, we generalize Parikh’s criterion, introducing (both axiomatically and semantically) a new notion of relevance, which we call relevance at the sentential level. We show that the proposed notion of relevance is universal (as it is applicable to arbitrary belief sets) and acts in a more refined way as compared to Parikh’s proposal; as we illustrate, this latter feature of relevance at the sentential level potentially leads to a significant drop in the computational resources required for implementing belief revision. Furthermore, we prove that Dalal’s popular revision operator respects, to a certain extent, relevance at the sentential level. Last but not least, the tight relation between local and relevance-sensitive revision is pointed out.","PeriodicalId":50916,"journal":{"name":"ACM Transactions on Computational Logic","volume":"69 27","pages":"1 - 29"},"PeriodicalIF":0.5,"publicationDate":"2022-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41308455","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Local Search For Satisfiability Modulo Integer Arithmetic Theories 可满足模整数算法理论的局部搜索

IF 0.5 4区数学

ACM Transactions on Computational Logic Pub Date : 2022-11-18 DOI: 10.1145/3597495

Shaowei Cai, Bohan Li, Xindi Zhang

{"title":"Local Search For Satisfiability Modulo Integer Arithmetic Theories","authors":"Shaowei Cai, Bohan Li, Xindi Zhang","doi":"10.1145/3597495","DOIUrl":"https://doi.org/10.1145/3597495","url":null,"abstract":"Satisfiability Modulo Theories (SMT) refers to the problem of deciding the satisfiability of a formula with respect to certain background first-order theories. In this article, we focus on Satisfiablity Modulo Integer Arithmetic, which is referred to as SMT(IA), including both linear and non-linear integer arithmetic theories. Dominant approaches to SMT rely on calling a CDCL-based SAT solver, either in a lazy or eager flavour. Local search, a competitive approach to solving combinatorial problems including SAT, however, has not been well studied for SMT. We develop the first local-search algorithm for SMT(IA) by directly operating on variables, breaking through the traditional framework. We propose a local-search framework by considering the distinctions between Boolean and integer variables. Moreover, we design a novel operator and scoring functions tailored for integer arithmetic, as well as a two-level operation selection heuristic. Putting these together, we develop a local search SMT(IA) solver called LocalSMT. Experiments are carried out to evaluate LocalSMT on benchmark sets from SMT-LIB. The results show that LocalSMT is competitive and complementary with state-of-the-art SMT solvers, and performs particularly well on those formulae with only integer variables. A simple sequential portfolio with Z3 improves the state-of-the-art on satisfiable benchmark sets from SMT-LIB.","PeriodicalId":50916,"journal":{"name":"ACM Transactions on Computational Logic","volume":"24 1","pages":"1 - 26"},"PeriodicalIF":0.5,"publicationDate":"2022-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45805729","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Are Two Binary Operators Necessary to Obtain a Finite Axiomatisation of Parallel Composition? 是否需要两个二元算子才能得到并行组合的有限公理化?

IF 0.5 4区数学

ACM Transactions on Computational Logic Pub Date : 2022-10-20 DOI: https://dl.acm.org/doi/10.1145/3529535

Luca Aceto, Valentina Castiglioni, Wan Fokkink, Anna Ingólfsdóttir, Bas Luttik

引用次数: 0

Precise Subtyping for Asynchronous Multiparty Sessions 异步多方会话的精确子类型

IF 0.5 4区数学

ACM Transactions on Computational Logic Pub Date : 2022-10-20 DOI: 10.1145/3568422

S. Ghilezan, J. Pantović, I. Prokić, A. Scalas, N. Yoshida

{"title":"Precise Subtyping for Asynchronous Multiparty Sessions","authors":"S. Ghilezan, J. Pantović, I. Prokić, A. Scalas, N. Yoshida","doi":"10.1145/3568422","DOIUrl":"https://doi.org/10.1145/3568422","url":null,"abstract":"Session subtyping is a cornerstone of refinement of communicating processes: a process implementing a session type (i.e., a communication protocol) T can be safely used whenever a process implementing one of its supertypes T′ is expected, in any context, without introducing deadlocks nor other communication errors. As a consequence, whenever T ≤ T′ holds, it is safe to replace an implementation of T′ with an implementation of the subtype T, which may allow for more optimised communication patterns. We present the first formalisation of the precise subtyping relation for asynchronous multiparty sessions. We show that our subtyping relation is sound (i.e., guarantees safe process replacement, as outlined above) and also complete: any extension of the relation is unsound. To achieve our results, we develop a novel session decomposition technique, from full session types (including internal/external choices) into single input/output session trees (without choices). We cover multiparty sessions with asynchronous interaction, where messages are transmitted via FIFO queues (as in the TCP/IP protocol), and prove that our subtyping is both operationally and denotationally precise. Our session decomposition technique expresses the subtyping relation as a composition of refinement relations between single input/output trees, and providing a simple reasoning principle for asynchronous message optimisations.","PeriodicalId":50916,"journal":{"name":"ACM Transactions on Computational Logic","volume":" ","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49126937","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 12

The Intersection of Algorithmically Random Closed Sets and Effective Dimension 算法随机闭集与有效维数的交集

IF 0.5 4区数学

ACM Transactions on Computational Logic Pub Date : 2022-10-20 DOI: https://dl.acm.org/doi/10.1145/3545114

Adam Case, Christopher P. Porter

引用次数: 0

The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games 并发多人游戏中联合目标分配的时间逻辑

IF 0.5 4区数学

ACM Transactions on Computational Logic Pub Date : 2022-10-20 DOI: https://dl.acm.org/doi/10.1145/3517128

Sebastian Enqvist, Valentin Goranko

{"title":"The Temporal Logic of Coalitional Goal Assignments in Concurrent Multiplayer Games","authors":"Sebastian Enqvist, Valentin Goranko","doi":"https://dl.acm.org/doi/10.1145/3517128","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3517128","url":null,"abstract":"We introduce and study a natural extension of the Alternating time temporal logic <sans-serif>ATL</sans-serif>, called Temporal Logic of Coalitional Goal Assignments (TLCGA). It features one new and quite expressive coalitional strategic operator, called the coalitional goal assignment operator ⦉ γ ⦊, where γ is a mapping assigning to each set of players in the game its coalitional goal, formalised by a path formula of the language of TLCGA, i.e., a formula prefixed with a temporal operator <sans-serif>X</sans-serif>, <sans-serif>U</sans-serif>, or <sans-serif>G</sans-serif>, representing a temporalised objective for the respective coalition, describing the property of the plays on which that objective is satisfied. Then, the formula ⦉ γ ⦊ intuitively says that there is a strategy profile Σ for the grand coalition <sans-serif>Agt</sans-serif> such that for each coalition C, the restriction Σ |C of Σ to C is a collective strategy of C that enforces the satisfaction of its objective γ (C) in all outcome plays enabled by Σ |C.We establish fixpoint characterizations of the temporal goal assignments in a μ-calculus extension of TLCGA, discuss its expressiveness and illustrate it with some examples, prove bisimulation invariance and Hennessy–Milner property for it with respect to a suitably defined notion of bisimulation, construct a sound and complete axiomatic system for TLCGA, and obtain its decidability via finite model property.","PeriodicalId":50916,"journal":{"name":"ACM Transactions on Computational Logic","volume":"40 10","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138508143","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Subatomic Proof System for Decision Trees 决策树的亚原子证明系统

IF 0.5 4区数学

ACM Transactions on Computational Logic Pub Date : 2022-10-20 DOI: https://dl.acm.org/doi/10.1145/3545116

Chris Barrett, Alessio Guglielmi

{"title":"A Subatomic Proof System for Decision Trees","authors":"Chris Barrett, Alessio Guglielmi","doi":"https://dl.acm.org/doi/10.1145/3545116","DOIUrl":"https://doi.org/https://dl.acm.org/doi/10.1145/3545116","url":null,"abstract":"We design a proof system for propositional classical logic that integrates two languages for Boolean functions: standard conjunction-disjunction-negation and binary decision trees. We give two reasons to do so. The first is proof-theoretical naturalness: The system consists of all and only the inference rules generated by the single, simple, linear scheme of the recently introduced subatomic logic. Thanks to this regularity, cuts are eliminated via a natural construction. The second reason is that the system generates efficient proofs. Indeed, we show that a certain class of tautologies due to Statman, which cannot have better than exponential cut-free proofs in the sequent calculus, have polynomial cut-free proofs in our system. We achieve this by using the same construction that we use for cut elimination. In summary, by expanding the language of propositional logic, we make its proof theory more regular and generate more proofs, some of which are very efficient.That design is made possible by considering atoms as superpositions of their truth values, which are connected by self-dual, non-commutative connectives. A proof can then be projected via each atom into two proofs, one for each truth value, without a need for cuts. Those projections are semantically natural and are at the heart of the constructions in this article. To accommodate self-dual non-commutativity, we compose proofs in deep inference.","PeriodicalId":50916,"journal":{"name":"ACM Transactions on Computational Logic","volume":"40 4","pages":""},"PeriodicalIF":0.5,"publicationDate":"2022-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138508148","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0