Some Complexity Results for Perceptron Networks

1998 ◽  
pp. 639-644 ◽  
Author(s):  
Barbara Hammer
Keyword(s):  
Complexity Results

Concern, Respect, and Cooperation

2018 ◽  
Author(s):  
Garrett Cullity
Keyword(s):  
Moral Theory ◽  
Fundamental Principle ◽  
Simple Set ◽  
Collective Activity ◽  
Complexity Results ◽  
Concern For Others ◽  
Moral Theories ◽  
Moral Responsibilities

Three things often recognized as central to morality are concern for others’ welfare, respect for their self-expression, and cooperation in worthwhile collective activity. When philosophers have proposed theories of the substance of morality, they have typically looked to one of these three sources to provide a single, fundamental principle of morality—or they have tried to formulate a master-principle for morality that combines these three ideas in some way. This book views them instead as three independently important foundations of morality. It sets out a plural-foundation moral theory with affinities to that of W. D. Ross. There are major differences: the account of the foundations of morality differs from Ross’s, and there is a more elaborate explanation of how the rest of morality derives from them. However, the overall aim is similar. This is to illuminate the structure of morality by showing how its complex content is generated from a relatively simple set of underlying elements—the complexity results from the various ways in which one part of morality can derive from another, and the various ways in which the derived parts of morality can interact. Plural-foundation moral theories are sometimes criticized for having nothing helpful to say about cases in which their fundamental norms conflict. Responding to this, the book concludes with three detailed applications of the theory: to the questions surrounding paternalism, the use of others as means, and our moral responsibilities as consumers.

Roman {k}-domination in trees and complexity results for some classes of graphs

2021 ◽  
Author(s):  
Cai-Xia Wang ◽  
Yu Yang ◽  
Hong-Juan Wang ◽  
Shou-Jun Xu
Keyword(s):  
Complexity Results

A compendium of parameterized complexity results

1994 ◽  
Vol 25 (3) ◽  
pp. 122-123 ◽  
Author(s):  
Michael T. Hallett ◽  
H. Todd Wareham
Keyword(s):  
Parameterized Complexity ◽  
Complexity Results

scholarly journals Bounds and complexity results for strong edge colouring of subcubic graphs

2011 ◽  
Vol 38 ◽  
pp. 463-468
Author(s):  
Hervé Hocquard ◽  
Pascal Ochem ◽  
Petru Valicov
Keyword(s):  
Complexity Results ◽  
Subcubic Graphs ◽  
Edge Colouring

scholarly journals Mīmāṃsā deontic reasoning using specificity: a proof theoretic approach

2020 ◽  
Author(s):  
Björn Lellmann ◽  
Francesca Gulisano ◽  
Agata Ciabattoni
Keyword(s):  
Deontic Logic ◽  
Sequent Calculus ◽  
Prima Facie ◽  
Theoretic Approach ◽  
Deontic Reasoning ◽  
Complexity Results ◽  
Restricted Form ◽  
Philosophical School ◽  
Decidability And Complexity ◽  
Potential Use

Abstract Over the course of more than two millennia the philosophical school of Mīmāṃsā has thoroughly analyzed normative statements. In this paper we approach a formalization of the deontic system which is applied but never explicitly discussed in Mīmāṃsā to resolve conflicts between deontic statements by giving preference to the more specific ones. We first extend with prohibitions and recommendations the non-normal deontic logic extracted in Ciabattoni et al. (in: TABLEAUX 2015, volume 9323 of LNCS, Springer, 2015) from Mīmāṃsā texts, obtaining a multimodal dyadic version of the deontic logic $$\mathsf {MD}$$ MD . Sequent calculus is then used to close a set of prima-facie injunctions under a restricted form of monotonicity, using specificity to avoid conflicts. We establish decidability and complexity results, and investigate the potential use of the resulting system for Mīmāṃsā philosophy and, more generally, for the formal interpretation of normative statements.

scholarly journals A Pattern Logic for Automata with Outputs

2020 ◽  
Vol 31 (06) ◽  
pp. 711-748
Author(s):  
Emmanuel Filiot ◽  
Nicolas Mazzocchi ◽  
Jean-François Raskin
Keyword(s):  
Model Checking ◽  
Structural Properties ◽  
Polynomial Time ◽  
Finite Automata ◽  
Structural Patterns ◽  
Complexity Results

We introduce a logic to express structural properties of automata with string inputs and, possibly, outputs in some monoid. In this logic, the set of predicates talking about the output values is parametric. We then consider three particular automata models (finite automata, transducers and automata weighted by integers here called sum-automata) and instantiate the generic logic for each of them. We give tight complexity results for the three logics with respect to the model-checking problem, depending on whether the formula is fixed or not. We study the expressiveness of our logics by expressing classical structural patterns characterising for instance finite ambiguity and polynomial ambiguity in the case of finite automata, determinisability and finite-valuedness in the case of transducers and sum-automata. As a consequence of our complexity results, we directly obtain that these classical properties can be decided in polynomial time.

Sign in / Sign up

Export Citation Format

Share Document