Related papers: Constraint Monotonicity, Epistemic Splitting and Foundedness Could in General Be Too Strong in Answer Set Programming

Constraint Monotonicity, Epistemic Splitting and Foundedness Could in General Be Too Strong in Answer Set Programming

URL: http://arxiv.org/abs/2010.00191v2
Date: Sat, 7 Nov 2020 11:16:07 GMT
Title: Constraint Monotonicity, Epistemic Splitting and Foundedness Could in General Be Too Strong in Answer Set Programming
Authors: Yi-Dong Shen and Thomas Eiter
Abstract summary: We consider the notions of subjective constraint monotonicity, epistemic splitting, and foundedness as main criteria respectively intuitions to compare different answer set semantics. In this note, we demonstrate on some examples that they may be too strong in general and may exclude some desired answer sets respectively world views.
Score: 32.60523531309687
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: Recently, the notions of subjective constraint monotonicity, epistemic splitting, and foundedness have been introduced for epistemic logic programs, with the aim to use them as main criteria respectively intuitions to compare different answer set semantics proposed in the literature on how they comply with these intuitions. In this note, we consider these three notions and demonstrate on some examples that they may be too strong in general and may exclude some desired answer sets respectively world views. In conclusion, these properties should not be regarded as mandatory properties that every answer set semantics must satisfy in general.

Related papers

A Unified View on Forgetting and Strong Equivalence Notions in Answer Set Programming [14.342696862884704]
We introduce a novel relativized equivalence notion, which is able to capture all related notions from the literature. We then introduce an operator that combines projection and a relaxation of (SP)-forgetting to obtain the relativized simplifications.
arXiv Detail & Related papers (2023-12-13T09:05:48Z)
A Semantic Approach to Decidability in Epistemic Planning (Extended Version) [72.77805489645604]
We use a novel semantic approach to achieve decidability. Specifically, we augment the logic of knowledge S5$_n$ and with an interaction axiom called (knowledge) commutativity. We prove that our framework admits a finitary non-fixpoint characterization of common knowledge, which is of independent interest.
arXiv Detail & Related papers (2023-07-28T11:26:26Z)
Simple Linguistic Inferences of Large Language Models (LLMs): Blind Spots and Blinds [59.71218039095155]
We evaluate language understanding capacities on simple inference tasks that most humans find trivial. We target (i) grammatically-specified entailments, (ii) premises with evidential adverbs of uncertainty, and (iii) monotonicity entailments. The models exhibit moderate to low performance on these evaluation sets.
arXiv Detail & Related papers (2023-05-24T06:41:09Z)
Admissibility in Strength-based Argumentation: Complexity and Algorithms (Extended Version with Proofs) [1.5828697880068698]
We study the adaptation of admissibility-based semantics to Strength-based Argumentation Frameworks (StrAFs) Especially, we show that the strong admissibility defined in the literature does not satisfy a desirable property, namely Dung's fundamental lemma. We propose a translation in pseudo-Boolean constraints for computing (strong and weak) extensions.
arXiv Detail & Related papers (2022-07-05T18:42:04Z)
Rationale-Augmented Ensembles in Language Models [53.45015291520658]
We reconsider rationale-augmented prompting for few-shot in-context learning. We identify rationale sampling in the output space as the key component to robustly improve performance. We demonstrate that rationale-augmented ensembles achieve more accurate and interpretable results than existing prompting approaches.
arXiv Detail & Related papers (2022-07-02T06:20:57Z)
Thirty years of Epistemic Specifications [8.339560855135575]
We extend disjunctive logic programs under the stable model semantics with modal constructs called subjective literals. Using subjective literals, it is possible to check whether a regular literal is true in every or some stable models of the program. Several attempts for capturing the intuitions underlying the language by means of a formal semantics were given.
arXiv Detail & Related papers (2021-08-17T15:03:10Z)
Anaphoric Binding: an integrated overview [0.0]
Different anaphors may have different sets of admissible antecedents. These constraints stem from what appears as quite cogent generalisations. This kind of anaphoric binding constraints appears as a most significant subset of natural language knowledge.
arXiv Detail & Related papers (2021-03-11T19:48:36Z)
On a plausible concept-wise multipreference semantics and its relations with self-organising maps [0.0]
We argue that this proposal satisfies some desired properties, such as KLM, and avoids the drowning problem. We motivate the plausibility of the concept-wise multi-preference semantics by developing a logical semantics of self-organising maps.
arXiv Detail & Related papers (2020-08-30T21:06:06Z)
Foundations of Reasoning with Uncertainty via Real-valued Logics [70.43924776071616]
We give a sound and strongly complete axiomatization that can be parametrized to cover essentially every real-valued logic. Our class of sentences are very rich, and each describes a set of possible real values for a collection of formulas of the real-valued logic.
arXiv Detail & Related papers (2020-08-06T02:13:11Z)
Logical Neural Networks [51.46602187496816]
We propose a novel framework seamlessly providing key properties of both neural nets (learning) and symbolic logic (knowledge and reasoning) Every neuron has a meaning as a component of a formula in a weighted real-valued logic, yielding a highly intepretable disentangled representation. Inference is omni rather than focused on predefined target variables, and corresponds to logical reasoning.
arXiv Detail & Related papers (2020-06-23T16:55:45Z)

This list is automatically generated from the titles and abstracts of the papers in this site.