Logical Methods in Computer Science最新文献_第4页

Chapter 16 Reasoning About Models 第十六章关于模型的推理

IF 0.6 4区数学

Logical Methods in Computer Science Pub Date : 2021-01-01 DOI: 10.1007/978-3-030-63777-4_17

R. Antonsen

引用次数: 0

A Linear Category of Polynomial Functors (extensional part) 多项式函子的线性范畴(扩展部分)

IF 0.6 4区数学

Logical Methods in Computer Science Pub Date : 2014-03-04 DOI: 10.2168/LMCS-10(2:2)2014

P. Hyvernat

引用次数: 5

On Separation by Locally Testable and Locally Threshold Testable Languages 局部可测试语言与局部阈值可测试语言的分离

IF 0.6 4区数学

Logical Methods in Computer Science Pub Date : 2013-08-01 DOI: 10.2168/LMCS-10(3:24)2014

Thomas Place, L. V. Rooijen, M. Zeitoun

引用次数: 16

Finite choice, convex choice and finding roots 有限选择，凸选择和求根

IF 0.6 4区数学

Logical Methods in Computer Science Pub Date : 2013-02-02 DOI: 10.2168/LMCS-11(4:6)2015

Stéphane Le Roux, A. Pauly

引用次数: 24

Tree-width for first order formulae 一阶公式的树宽度

IF 0.6 4区数学

Logical Methods in Computer Science Pub Date : 2012-03-29 DOI: 10.2168/LMCS-8(1:32)2012

Isolde Adler, M. Weyer

{"title":"Tree-width for first order formulae","authors":"Isolde Adler, M. Weyer","doi":"10.2168/LMCS-8(1:32)2012","DOIUrl":"https://doi.org/10.2168/LMCS-8(1:32)2012","url":null,"abstract":"We introduce tree-width for first order formulae phi, fotw(phi). We show\u0000that computing fotw is fixed-parameter tractable with parameter fotw. Moreover,\u0000we show that on classes of formulae of bounded fotw, model checking is fixed\u0000parameter tractable, with parameter the length of the formula. This is done by\u0000translating a formula phi with fotw(phi)<k into a formula of the k-variable\u0000fragment L^k of first order logic. For fixed k, the question whether a given\u0000first order formula is equivalent to an L^k formula is undecidable. In\u0000contrast, the classes of first order formulae with bounded fotw are fragments\u0000of first order logic for which the equivalence is decidable.\u0000 Our notion of tree-width generalises tree-width of conjunctive queries to\u0000arbitrary formulae of first order logic by taking into account the quantifier\u0000interaction in a formula. Moreover, it is more powerful than the notion of\u0000elimination-width of quantified constraint formulae, defined by Chen and Dalmau\u0000(CSL 2005): for quantified constraint formulae, both bounded elimination-width\u0000and bounded fotw allow for model checking in polynomial time. We prove that\u0000fotw of a quantified constraint formula phi is bounded by the\u0000elimination-width of phi, and we exhibit a class of quantified constraint\u0000formulae with bounded fotw, that has unbounded elimination-width. A similar\u0000comparison holds for strict tree-width of non-recursive stratified datalog as\u0000defined by Flum, Frick, and Grohe (JACM 49, 2002).\u0000 Finally, we show that fotw has a characterization in terms of a cops and\u0000robbers game without monotonicity cost.","PeriodicalId":49904,"journal":{"name":"Logical Methods in Computer Science","volume":"8 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2012-03-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67823829","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

Selected Papers of the Conference "Typed Lambda Calculi and Applications 2009" 2009年“类型化Lambda演算及其应用”会议论文选集

IF 0.6 4区数学

Logical Methods in Computer Science Pub Date : 2012-01-01 DOI: 10.2168/LMCS-TCLA:2009

B. Patrick, Curien Pierre-Louis, Paolini Luca

引用次数: 0

The Complexity of the First-Order Theory of Ground Tree Rewrite Graphs 地树重写图一阶理论的复杂性

IF 0.6 4区数学

Logical Methods in Computer Science Pub Date : 2011-07-05 DOI: 10.2168/LMCS-10(1:7)2014

Stefan Goller, Markus Lohrey

引用次数: 2

Markov Decision Processes with Multiple Long-Run AverageObjectives 具有多个长期平均目标的马尔可夫决策过程

IF 0.6 4区数学

Logical Methods in Computer Science Pub Date : 2011-04-18 DOI: 10.2168/LMCS-10(1:13)2014

Tom'avs Br'azdil, V'aclav Brovzek, K. Chatterjee, Vojtvech Forejt, Anton'in Kuvcera

{"title":"Markov Decision Processes with Multiple Long-Run AverageObjectives","authors":"Tom'avs Br'azdil, V'aclav Brovzek, K. Chatterjee, Vojtvech Forejt, Anton'in Kuvcera","doi":"10.2168/LMCS-10(1:13)2014","DOIUrl":"https://doi.org/10.2168/LMCS-10(1:13)2014","url":null,"abstract":"We study Markov decision processes (MDPs) with multiple\u0000limit-average (or mean-payoff) functions. We consider two\u0000different objectives, namely, expectation and satisfaction\u0000objectives. Given an MDP with k limit-average functions, in the\u0000expectation objective the goal is to maximize the expected\u0000limit-average value, and in the satisfaction objective the goal\u0000is to maximize the probability of runs such that the\u0000limit-average value stays above a given vector. We show that\u0000under the expectation objective, in contrast to the case of one\u0000limit-average function, both randomization and memory are\u0000necessary for strategies even for epsilon-approximation, and\u0000that finite-memory randomized strategies are sufficient for\u0000achieving Pareto optimal values. Under the satisfaction\u0000objective, in contrast to the case of one limit-average\u0000function, infinite memory is necessary for strategies achieving\u0000a specific value (i.e. randomized finite-memory strategies are\u0000not sufficient), whereas memoryless randomized strategies are\u0000sufficient for epsilon-approximation, for all epsilon>0. We\u0000further prove that the decision problems for both expectation\u0000and satisfaction objectives can be solved in polynomial time\u0000and the trade-off curve (Pareto curve) can be\u0000epsilon-approximated in time polynomial in the size of the MDP\u0000and 1/epsilon, and exponential in the number of limit-average\u0000functions, for all epsilon>0. Our analysis also reveals flaws\u0000in previous work for MDPs with multiple mean-payoff functions\u0000under the expectation objective, corrects the flaws, and allows\u0000us to obtain improved results.","PeriodicalId":49904,"journal":{"name":"Logical Methods in Computer Science","volume":"10 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2011-04-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67822621","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}

引用次数: 29

URSA: A System for Uniform Reduction to SAT 统一还原到SAT的系统

IF 0.6 4区数学

Logical Methods in Computer Science Pub Date : 2010-12-06 DOI: 10.2168/LMCS-8(3:30)2012

Predrag Janičić

{"title":"URSA: A System for Uniform Reduction to SAT","authors":"Predrag Janičić","doi":"10.2168/LMCS-8(3:30)2012","DOIUrl":"https://doi.org/10.2168/LMCS-8(3:30)2012","url":null,"abstract":"There are a huge number of problems, from various areas, being solved by\u0000reducing them to SAT. However, for many applications, translation into SAT is\u0000performed by specialized, problem-specific tools. In this paper we describe a\u0000new system for uniform solving of a wide class of problems by reducing them to\u0000SAT. The system uses a new specification language URSA that combines imperative\u0000and declarative programming paradigms. The reduction to SAT is defined\u0000precisely by the semantics of the specification language. The domain of the\u0000approach is wide (e.g., many NP-complete problems can be simply specified and\u0000then solved by the system) and there are problems easily solvable by the\u0000proposed system, while they can be hardly solved by using other programming\u0000languages or constraint programming systems. So, the system can be seen not\u0000only as a tool for solving problems by reducing them to SAT, but also as a\u0000general-purpose constraint solving system (for finite domains). In this paper,\u0000we also describe an open-source implementation of the described approach. The\u0000performed experiments suggest that the system is competitive to\u0000state-of-the-art related modelling systems.","PeriodicalId":49904,"journal":{"name":"Logical Methods in Computer Science","volume":"8 1","pages":""},"PeriodicalIF":0.6,"publicationDate":"2010-12-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"67823972","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}

引用次数: 18

COMPLEXITY CLASSIFICATIONS FOR DIFFERENT EQUIVALENCE AND AUDIT PROBLEMS FOR BOOLEAN CIRCUITS 布尔电路不同等价和审计问题的复杂度分类

IF 0.6 4区数学

Logical Methods in Computer Science Pub Date : 2010-09-07 DOI: 10.2168/LMCS-8(3:31)2012

Elmar BAPhler, N. Creignou, Matthias Galota, S. Reith, Henning Schnoor, H. Vollmer

引用次数: 3