scholarly journals Document Spanners: From Expressive Power to Decision Problems

2017 ◽  
Vol 62 (4) ◽  
pp. 854-898 ◽  
Author(s):  
Dominik D. Freydenberger ◽  
Mario Holldack
Keyword(s):  
Expressive Power ◽  
Decision Problems

scholarly journals Pure-Past Linear Temporal and Dynamic Logic on Finite Traces

2020 ◽  
Author(s):  
Giuseppe De Giacomo ◽  
Antonio Di Stasio ◽  
Francesco Fuggitti ◽  
Sasha Rubin
Keyword(s):  
Decision Making ◽  
Dynamic Logic ◽  
Expressive Power ◽  
Decision Problems ◽  
Sequential Decision Making ◽  
Sequential Decision ◽  
The Past ◽  
Temporal Specifications

We review PLTLf and PLDLf, the pure-past versions of the well-known logics on finite traces LTLf and LDLf, respectively. PLTLf and PLDLf are logics about the past, and so scan the trace backwards from the end towards the beginning. Because of this, we can exploit a foundational result on reverse languages to get an exponential improvement, over LTLf /LDLf , for computing the corresponding DFA. This exponential improvement is reflected in several forms of sequential decision making involving temporal specifications, such as planning and decision problems in non-deterministic and non-Markovian domains. Interestingly, PLTLf (resp., PLDLf ) has the same expressive power as LTLf (resp., LDLf ), but transforming a PLTLf (resp., PLDLf ) formula into its equivalent LTLf (resp.,LDLf) is quite expensive. Hence, to take advantage of the exponential improvement, properties of interest must be directly expressed in PLTLf /PLDLf .

Bipolar Abstract Argumentation with Dual Attacks and Supports

2020 ◽  
Author(s):  
Nico Potyka
Keyword(s):  
Computational Complexity ◽  
Decision Problems ◽  
Abstract Argumentation ◽  
Stable Semantics ◽  
Support Relations ◽  
Support Relationships ◽  
Computational Properties ◽  
Inherent Tendency

Bipolar abstract argumentation frameworks allow modeling decision problems by defining pro and contra arguments and their relationships. In some popular bipolar frameworks, there is an inherent tendency to favor either attack or support relationships. However, for some applications, it seems sensible to treat attack and support equally. Roughly speaking, turning an attack edge into a support edge, should just invert its meaning. We look at a recently introduced bipolar argumentation semantics and two novel alternatives and discuss their semantical and computational properties. Interestingly, the two novel semantics correspond to stable semantics if no support relations are present and maintain the computational complexity of stable semantics in general bipolar frameworks.

Multiobjective Hierarchical Decision Problems in C3, III.

1985 ◽  
Author(s):  
UNIVERSITY OF SOUTHERN CALIFORNIA DOWNEY
Keyword(s):  
Decision Problems ◽  
Hierarchical Decision

Some Strategic Decision Problems in Networks

2020 ◽  
Author(s):  
Manfred Holler ◽  
Florian Rupp
Keyword(s):  
Strategic Decision ◽  
Decision Problems
Sign in / Sign up

Export Citation Format

Share Document