Journal of Logic and Computation最新文献_第8页

Extension of constraint-procedural logic-generated environments for deep Q-learning agent training and benchmarking 深度q学习智能体训练和基准测试的约束程序逻辑生成环境的扩展

4区数学

Journal of Logic and Computation Pub Date : 2023-06-07 DOI: 10.1093/logcom/exad032

Giovanni De Gasperis, Stefania Costantini, Andrea Rafanelli, Patrizio Migliarini, Ivan Letteri, Abeer Dyoub

{"title":"Extension of constraint-procedural logic-generated environments for deep Q-learning agent training and benchmarking","authors":"Giovanni De Gasperis, Stefania Costantini, Andrea Rafanelli, Patrizio Migliarini, Ivan Letteri, Abeer Dyoub","doi":"10.1093/logcom/exad032","DOIUrl":"https://doi.org/10.1093/logcom/exad032","url":null,"abstract":"Abstract Autonomous robots can be employed in exploring unknown environments and performing many tasks, such as, e.g. detecting areas of interest, collecting target objects, etc. Deep reinforcement learning (RL) is often used to train this kind of robot. However, concerning the artificial environments aimed at testing the robot, there is a lack of available data sets and a long time is needed to create them from scratch. A good data set is in fact usually produced with high effort in terms of cost and human work to satisfy the constraints imposed by the expected results. In the first part of this paper, we focus on the specification of the properties of the solutions needed to build a data set, making the case of environment exploration. In the proposed approach, rather than using imperative programming, we explore the possibility of generating data sets using constraint programming in Prolog. In this phase, geometric predicates describe a virtual environment according to inter-space requirements. The second part of the paper is focused on testing the generated data set in an AI gym via space search techniques. We developed a Neuro-Symbolic agent built from the following: (i) A deep Q-learning component implemented in Python, able to address via RL a search problem in the virtual space; the agent has the goal to explore a generated virtual environment to seek for a target, improving its performance through a RL process. (ii) A symbolic component able to re-address the search when the Q-learning component gets stuck in a part of the virtual environment; these components stimulate the agent to move to and explore other parts of the environment. Wide experimentation has been performed, with promising results, and is reported, to demonstrate the effectiveness of the approach.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135449358","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

Constraint propagation on GPU: A case study for the AllDifferent constraint GPU上的约束传播:AllDifferent约束的案例研究

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2023-06-06 DOI: 10.1093/logcom/exad033

Fabio Tardivo, A. Dovier, A. Formisano, L. Michel, Enrico Pontelli

引用次数: 0

Some techniques for reasoning automatically on co-inductive data structures 共归纳数据结构的自动推理技术

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2023-06-06 DOI: 10.1093/logcom/exad028

N. Peltier

引用次数: 0

Efficient compliance checking of RDF data RDF数据的高效遵从性检查

4区数学

Journal of Logic and Computation Pub Date : 2023-06-06 DOI: 10.1093/logcom/exad034

Livio Robaldo, Francesco Pacenza, Jessica Zangari, Roberta Calegari, Francesco Calimeri, Giovanni Siragusa

引用次数: 1

Permissive and regulative norms in deontic logic 道义逻辑中的允许规范和规范规范

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2023-05-31 DOI: 10.1093/logcom/exad024

Maya Olszewski, X. Parent, Leendert van der Torre

引用次数: 0

Kettle logic in abstract argumentation 抽象论证中的水壶逻辑

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2023-05-25 DOI: 10.1093/logcom/exad027

Timotheus Kampik

{"title":"Kettle logic in abstract argumentation","authors":"Timotheus Kampik","doi":"10.1093/logcom/exad027","DOIUrl":"https://doi.org/10.1093/logcom/exad027","url":null,"abstract":"\u0000 Kettle logic is a colloquial term that describes an agent’s advancement of inconsistent arguments in order to defeat a particular claim. Intuitively, a consistent subset of the advanced arguments should exist that is at least as successful at refuting the claim as the advancement of the set of inconsistent arguments. In this paper, we formalize this intuition and provide a formal analysis of kettle logic in abstract argumentation, a fundamental approach to computational argumentation, showing that all of the analysed abstract argumentation semantics (inference functions)—with the exception of naive semantics, which is considered a mere simplistic helper for the construction of other semantics—suffer from kettle logic. We also provide an approach to mitigating kettle logic under some circumstances. The key findings presented in this paper highlight that agents that apply the inference functions of abstract argumentation, are—similarly to humans—receptive to persuasion by agents who deliberately advance inconsistent and intuitively ‘illogical’ claims. As abstract argumentation can be considered one of the most basic models of computational argumentation, this raises the question to what extent and under what circumstances kettle logic-free argumentation can and should be enforced by computational means.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":" ","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48797074","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

The extended predicative Mahlo universe in Martin-Löf type theory Martin-Löf类型论中扩展的谓词Mahlo宇宙

4区数学

Journal of Logic and Computation Pub Date : 2023-05-12 DOI: 10.1093/logcom/exad022

Peter Dybjer, Anton Setzer

{"title":"The extended predicative Mahlo universe in Martin-Löf type theory","authors":"Peter Dybjer, Anton Setzer","doi":"10.1093/logcom/exad022","DOIUrl":"https://doi.org/10.1093/logcom/exad022","url":null,"abstract":"Abstract This paper addresses the long-standing question of the predicativity of the Mahlo universe. A solution, called the extended predicative Mahlo universe, has been proposed by Kahle and Setzer in the context of explicit mathematics. It makes use of the collection of untyped terms (denoting partial functions) which are directly available in explicit mathematics but not in Martin-Löf type theory. In this paper, we overcome the obstacle of not having direct access to untyped terms in Martin-Löf type theory by formalizing explicit mathematics with an extended predicative Mahlo universe in Martin-Löf type theory with certain indexed inductive-recursive definitions. In this way, we can relate the predicativity question to the fundamental semantics of Martin-Löf type theory in terms of computation to canonical form. As a result, we get the first extended predicative definition of a Mahlo universe in Martin-Löf type theory. To this end, we first define an external variant of Kahle and Setzer’s internal extended predicative universe in explicit mathematics. This is then formalized in Martin-Löf type theory, where it becomes an internal extended predicative Mahlo universe. Although we make use of indexed inductive-recursive definitions that go beyond the type theory $mathbf {IIRD}$ of indexed inductive-recursive definitions defined in previous work by the authors, we argue that they are constructive and predicative in Martin-Löf’s sense. The model construction has been type-checked in the proof assistant Agda.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135389198","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

Nonmonotonic inferences: Classical conclusions in an intuitionistic modal framework 非单调推理:直觉模态框架中的经典结论

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2023-05-08 DOI: 10.1093/logcom/exad020

Gisèle Fischer Servi

引用次数: 0

Correction to: Argumentation Frameworks with Attack Classification 修正:带有攻击分类的论证框架

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2023-05-03 DOI: 10.1093/logcom/exad026

引用次数: 0

A new perspective on completeness and finitist consistency 关于完备性和有限一致性的新观点

IF 0.7 4区数学

Journal of Logic and Computation Pub Date : 2023-04-24 DOI: 10.1093/logcom/exad021

P. G. Santos, W. Sieg, R. Kahle

{"title":"A new perspective on completeness and finitist consistency","authors":"P. G. Santos, W. Sieg, R. Kahle","doi":"10.1093/logcom/exad021","DOIUrl":"https://doi.org/10.1093/logcom/exad021","url":null,"abstract":"\u0000 In this paper, we study the metamathematics of consistent arithmetical theories $T$ (containing $textsf {I}varSigma _{1}$); we investigate numerical properties based on proof predicates that depend on numerations of the axioms. Numeral Completeness. For every true (in $mathbb {N}$) sentence $vec {Q}vec {x}.varphi (vec {x})$, with $varphi (vec {x})$ a $varSigma _{1}(textsf {I}varSigma _1)$-formula, there is a numeration $tau $ of the axioms of $T$ such that $textsf {I}varSigma _1vdash vec {Q}vec {x}. texttt {Pr}_{tau }(ulcorner varphi (overset {text{.} }{vec {x}})urcorner )$, where $texttt {Pr}_{tau }$ is the provability predicate for the numeration $tau $.\u0000 Numeral Consistency. If $T$ is consistent, there is a $varSigma _{1}(textsf {I}varSigma _1)$-numeration $tau $ of the axioms of $textsf {I}varSigma _{1}$ such that $textsf {I}varSigma _1vdash forall, x. texttt {Pr}_{tau }(ulcorner neg textit {Prf}(ulcorner perp urcorner , overset {text{.}}{x})urcorner )$, where $textit {Prf}(x,y)$ denotes a $varDelta _{1}(textsf {I}varSigma _1)$-definition of ‘$y$ is a $T$-proof of $x$’. Finitist consistency is addressed by generalizing a result of Artemov:\u0000 Partial finitism. If $T$ is consistent, there is a primitive recursive function $f$ such that, for all $nin mathbb {N}$, $f(n)$ is the code of an $textsf {I}varSigma _{1}$-proof of $neg, textit{Prf}(ulcorner perp urcorner ,overline {n})$.\u0000 These results are not in conflict with Gödel’s Incompleteness Theorems. Rather, they allow to extend their usual interpretation and show a deep connection to reflections in Hilbert’s last papers of 1931.","PeriodicalId":50162,"journal":{"name":"Journal of Logic and Computation","volume":" ","pages":""},"PeriodicalIF":0.7,"publicationDate":"2023-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43622574","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