Answer Set programming (ASP) is a prominent knowledge representation language with roots in logicprogramming and non-monotonic reasoning. Biennial ASP competitions are organized in order to furnish challenging benchm...
详细信息
Answer Set programming (ASP) is a prominent knowledge representation language with roots in logicprogramming and non-monotonic reasoning. Biennial ASP 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 on the design and results of the Seventh ASP Competition, jointly organized by the University of Calabria (Italy), the University of Genova (Italy), and the University of Potsdam (Germany), in affiliation with the 14th International Conference on logicprogramming and Non-Monotonic Reasoning (LPNMR 2017).
Non-wellfounded and circular proofs have been recognised over the past decade as a valuable tool to study logics expressing (co)inductive properties, e.g. mu-calculi. Such proofs are non-wellfounded sequent derivation...
详细信息
ISBN:
(纸本)9781450386890
Non-wellfounded and circular proofs have been recognised over the past decade as a valuable tool to study logics expressing (co)inductive properties, e.g. mu-calculi. Such proofs are non-wellfounded sequent derivations together with a global validity condition expressed in terms of progressing threads. While the cut-free fragment of circular proofs is satisfactory, cuts are poorly treated and the non-canonicity of sequent proofs becomes a major issue in the non-wellfounded setting. The present paper develops for mu MLL (multiplicative linear logic with fixed points) the theory of infinets - proof-nets for non-wellfounded proofs. Our structures handles infinitely many cuts therefore solving a crucial shortcoming of the previous work [19]. We characterise correctness, define a more complete cut-reduction system and proving a cut-elimination theorem. To that end, we also provide an alternate cut reduction for non-wellfounded sequent calculus.
A complete classification of the complexity of the local and global satisfiability problems for graded modal language over traditional classes of frames has already been established. By "traditional" classes...
详细信息
A complete classification of the complexity of the local and global satisfiability problems for graded modal language over traditional classes of frames has already been established. By "traditional" classes of frames, we mean those characterized by any positive combination of reflexivity, seriality, symmetry, transitivity, and the Euclidean property. In this paper, we fill the gaps remaining in an analogous classification of the graded modal language with graded converse modalities. In particular, we show its NExpTime-completeness over the class of Euclidean frames, demonstrating this way that over this class the considered language is harder than the language without graded modalities or without converse modalities. We also consider its variation disallowing graded converse modalities, but still admitting basic converse modalities. Our most important result for this variation is confirming an earlier conjecture that it is decidable over transitive frames. This contrasts with the undecidability of the language with graded converse modalities.
We introduce negation under the stable model semantics in DatalogMTL—a temporal extension of Datalog with metric temporal operators. As a result, we obtain a rule language which combines the power of answer set progr...
详细信息
The representation of a temporal problem in ASP usually boils down to using copies of variables and constraints, one for each time stamp, no matter whether it is directly encoded or expressed via an action or temporal...
详细信息
The proceedings contain 21 papers. The topics discussed include: programming languages techniques for controlling generalization errors in adaptive data analysis;the computational structure of programs and the univers...
ISBN:
(纸本)9781450386890
The proceedings contain 21 papers. The topics discussed include: programming languages techniques for controlling generalization errors in adaptive data analysis;the computational structure of programs and the universe;reflecting stacked continuations in a fine-grained direct-style reduction theory;a derived reasonable abstract machine for strong call by value;canonical proof-objects for coinductive programming: infinets with infinitely many cuts;confluence in non-left-linear untyped higher-order rewrite theories;static analysis of pattern-free properties,;a superposition-based calculus for diagrammatic reasoning;and free objects in constraint-logic object-oriented programming.
Guarded Interaction Trees are a structure and a fully formalized framework for representing higher-order computations with higher-order effects in Coq. We present an extension of Guarded Interaction Trees to supp...
详细信息
Concurrent randomized programs in the oblivious adversary model are extremely difficult for modular verification because the interaction between threads is very sensitive to the program structure and the exe...
详细信息
The Industrial Modeling and programming Language (IMPL) is a sophisticated computational system for tackling large-scale and complex-scope data analytics and decision-making problems in the engineering and operations ...
详细信息
Intensional sets, i.e., sets given by a property rather than by enumerating elements, are widely recognized as a key feature to describe complex problems (see, e.g., specification languages such as B and Z). Notwithst...
详细信息
Intensional sets, i.e., sets given by a property rather than by enumerating elements, are widely recognized as a key feature to describe complex problems (see, e.g., specification languages such as B and Z). Notwithstanding, very few tools exist supporting high-level automated reasoning on general formulas involving intensional sets. In this paper we present a decision procedure for a first-order logic language offering both extensional and (a restricted form of) intensional sets (RIS). RIS are introduced as first-class citizens of the language, and set-theoretical operators on RIS are dealt with as constraints. Syntactic restrictions on RIS guarantee that the denoted sets are finite. The language of RIS, called LRIS, is parametric with respect to any first-order theory X providing at least equality and a decision procedure for X-formulas. In particular, we consider the instance of LRIS when X is the theory of hereditarily finite sets and binary relations. We also present a working implementation of this instance as part of the {log} tool, and we show through a number of examples and two case studies that, although RIS are a subclass of general intensional sets, they are still sufficiently expressive as to encode and solve many interesting problems. Finally, an extensive empirical evaluation provides evidence that the tool can be used in practice.
暂无评论