Qualitative spatial relations are used in artificialintelligence to model commonsense notions such as regions of space overlapping, touching only at their boundaries, or being separate. In this paper we extend earlie...
详细信息
ISBN:
(纸本)9783030021498;9783030021481
Qualitative spatial relations are used in artificialintelligence to model commonsense notions such as regions of space overlapping, touching only at their boundaries, or being separate. In this paper we extend earlier work on qualitative relations in discrete space by presenting a bi-intuitionistic modal logic with universal modalities, called UBiSKt. this logic has a semantics in which formulae are interpreted as subgraphs. We show how a variety of qualitative spatial relations can be defined in UBiSKt. We make essential use of a sound and complete axiomatisation of the logic and an implementation of a tableau based theorem prover to establish novel properties of these spatial relations. We also explore the role of UBiSKt in expressing spatial relations at more than one level of detail. the features of the logic allow it to represent how a subgraph at a detailed level is approximated at a coarser level.
the proceedings contain 19 papers. the special focus in this conference is on Verified Software: theories, Tools, and Experiments. the topics include: Constructing Independently Verifiable Privacy-Compliant Type Syste...
ISBN:
(纸本)9783030035914
the proceedings contain 19 papers. the special focus in this conference is on Verified Software: theories, Tools, and Experiments. the topics include: Constructing Independently Verifiable Privacy-Compliant Type Systems for Message Passing Between Black-Box Components;sideTrail: Verifying Time-Balancing of Cryptosystems;towards Verification of Ethereum Smart Contracts: A Formalization of Core of Solidity;relational Equivalence Proofs Between Imperative and MapReduce Algorithms;practical Methods for reasoning About Java 8’s Functional programming Features;verification of Binarized Neural Networks via Inter-neuron Factoring: (Short Paper);the Map Equality Domain;loop Detection by logically Constrained Term Rewriting;store Buffer Reduction in the Presence of Mixed-Size Accesses and Misalignment;executable Counterexamples in Software Model Checking;Extending VIAP to Handle Array Programs;lattice-Based Refinement in Bounded Model Checking;verified Certificate Checking for Counting Votes;program Verification in the Presence of I/O: Semantics, Verified Library Routines, and Verified Applications;TWAM: A Certifying Abstract Machine for logic Programs;a Java Bytecode Formalisation;formalising Executable Specifications of Low-Level Systems.
Answer Set programming (ASP) is a prominent knowledge representation language with roots in logicprogramming and non-monotonic reasoning. Biennial competitions are organized in order to furnish challenging benchmark ...
详细信息
ISBN:
(纸本)9783319616605;9783319616599
Answer Set programming (ASP) is a prominent knowledge representation language with roots in logicprogramming and non-monotonic reasoning. Biennial competitions are organized in order to furnish challenging benchmark collections and assess the advancement of the state of the art in ASP solving. In this paper, we report about the design of the Seventh ASP Competition, which is jointly organized by the University of Calabria (Italy), the University of Genova (Italy), and the University of Potsdam (Germany), in affiliation withthe 14thinternationalconference on logicprogramming and Non-Monotonic reasoning (LPNMR 2017). A novel feature of this competition edition is the re-introduction of a Model&Solve track, complementing the usual System track with problem domains where participants need to provide dedicated encodings and solving means.
Answer Set programming (ASP) is a well-known paradigm of declarative programming with roots in logicprogramming and non-monotonic reasoning. Similar to other closely related problem-solving technologies, such as SAT/...
详细信息
Answer Set programming (ASP) is a well-known paradigm of declarative programming with roots in logicprogramming and non-monotonic reasoning. Similar to other closely related problem-solving technologies, such as SAT/SMT, QBF, Planning and Scheduling, advancements in ASP solving are assessed in competition events. In this paper, we report about the design and results of the Sixth ASP Competition, which was jointly organized by the University of Calabria (Italy), Aalto University (Finland), and the University of Genoa (Italy), in affiliation withthe 13thinternationalconference on logicprogramming and Non-Monotonic reasoning. this edition maintained some of the design decisions introduced in 2014, e.g., the conception of sub-tracks, the scoring scheme, and the adherence to a fixed modeling language in order to push the adoption of the ASP-Core-2 standard. On the other hand, it featured also some novelties, like a benchmark selection stage classifying instances according to their empirical hardness, and a "Marathon" track where the top-performing systems are given more time for solving hard benchmarks.
Argumentation has gained popularity in AI in recent years to support several activities and forms of reasoning. this talk will trace back the logicprogramming and non-monotonic reasoning origins of two well-known arg...
详细信息
ISBN:
(纸本)9783319616605;9783319616599
Argumentation has gained popularity in AI in recent years to support several activities and forms of reasoning. this talk will trace back the logicprogramming and non-monotonic reasoning origins of two well-known argumentation formalisms in AI (namely abstract argumentation and assumption-based argumentation). Finally, the talk will discuss recent developments in AI making use of computational argumentation, in particular to support collaborative decision making.
this paper introduces a novel monotonic modal logic, able to characterise reflexive autoepistemic reasoning of the nonmonotonic variant of modal logic SW5: we add a second new modal operator into the original language...
详细信息
ISBN:
(纸本)9783319616605;9783319616599
this paper introduces a novel monotonic modal logic, able to characterise reflexive autoepistemic reasoning of the nonmonotonic variant of modal logic SW5: we add a second new modal operator into the original language of SW5, and show that the resulting formalism called MRAE* is strong enough to capture the minimal model notion underlying some major forms of nonmonotonic logic among which are autoepistemic logic, default logic, and nonmonotonic logicprogramming. the paper ends with a discussion of a general strategy, naturally embedding several nonmonotonic logics of similar kinds.
Defeasible Description logics (DDLs) can state defeasible concept inclusions and often use rational closure according to the KLM postulates for reasoning. If in DDLs with quantification a defeasible sub-sumption relat...
详细信息
ISBN:
(纸本)9783319616605;9783319616599
Defeasible Description logics (DDLs) can state defeasible concept inclusions and often use rational closure according to the KLM postulates for reasoning. If in DDLs with quantification a defeasible sub-sumption relationship holds between concepts, it can also hold if these concepts appear nested in existential restrictions. Earlier reasoning algorithms did not detect this kind of relationships. We devise a new form of canonical models that extend classical ones for EL. by elements that satisfy increasing amounts of defeasible knowledge and show that reasoning w.r.t. these models yields the missing rational entailments.
the paper presents some applications in planning and multi-agent systems of answer set programming. It highlights the benefits of answer set programming based techniques in these applications. It also describes a clas...
详细信息
ISBN:
(纸本)9783319616605;9783319616599
the paper presents some applications in planning and multi-agent systems of answer set programming. It highlights the benefits of answer set programming based techniques in these applications. It also describes a class of multi-agent planning problems that is challenging to answer set programming.
the paper deals withthe fundamental computational rule of functional programming languages, namely the rule of beta conversion. this rule specifies the way in which a function f is applied to its argument a. there ar...
详细信息
A concentrator is a circuit with N inputs and M <= N outputs that can route any given subset of K <= M valid inputs to K of its M outputs. Concentrator circuits are important building blocks of many parallel alg...
详细信息
ISBN:
(纸本)9783319616605;9783319616599
A concentrator is a circuit with N inputs and M <= N outputs that can route any given subset of K <= M valid inputs to K of its M outputs. Concentrator circuits are important building blocks of many parallel algorithms. the design of optimal concentrator circuits is however a challenging task that has already been considered in many research papers. In this paper, we show how answer set programming can be used to automatically generate concentrator circuits of provably optimal size.
暂无评论