Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning

1999 ◽  
pp. 1-18 ◽  
Author(s):  
Georg Gottlob ◽  
Francesco Scarcello ◽  
Martha Sideri
Keyword(s):  
Nonmonotonic Reasoning ◽  
Fixed Parameter

scholarly journals Fixed-parameter complexity in AI and nonmonotonic reasoning

2002 ◽  
Vol 138 (1-2) ◽  
pp. 55-86 ◽  
Author(s):  
Georg Gottlob ◽  
Francesco Scarcello ◽  
Martha Sideri
Keyword(s):  
Nonmonotonic Reasoning ◽  
Fixed Parameter

scholarly journals Fixed-Parameter Extrapolation and Aperiodic Order

2018 ◽  
Vol 49 (3) ◽  
pp. 35-47
Author(s):  
Stephen Fenner ◽  
Frederic Green ◽  
Steven Homer
Keyword(s):  
Aperiodic Order ◽  
Fixed Parameter

The complexity of fixed-parameter problems

2008 ◽  
Vol 39 (1) ◽  
pp. 33-46 ◽  
Author(s):  
Jonathan F. Buss ◽  
Tarique M. Islam
Keyword(s):  
Fixed Parameter

Formalization of Inheritance Reasoning in Autoepistemic Logic

1990 ◽  
Vol 13 (4) ◽  
pp. 403-443
Author(s):  
Michael Gelfond ◽  
Halina Przymusinska
Keyword(s):  
General Framework ◽  
Nonmonotonic Reasoning ◽  
Commonsense Reasoning ◽  
Autoepistemic Logic

Current research in the area of nonmonotonic reasoning suggests that autoepistemic logic provides a general framework for formalizing commonsense reasoning in various domains of discourse. The goal of this paper is to investigate the suitability of autoepistemic logic for formalization of some forms of inheritance reasoning. To this end we propose a new semantics for inheritance networks with exceptions based on autoepistemic logic.

Default Logic Models of Certain Inheritance Systems with Exceptions

1993 ◽  
Vol 18 (2-4) ◽  
pp. 129-149
Author(s):  
Serge Garlatti
Keyword(s):  
Hierarchical Structure ◽  
Formal Semantics ◽  
Sufficient Conditions ◽  
Nonmonotonic Reasoning ◽  
Default Logic ◽  
Representation Systems ◽  
The Hierarchical Structure ◽  
Necessary And Sufficient ◽  
Structure Of Knowledge ◽  
Made In

Representation systems based on inheritance networks are founded on the hierarchical structure of knowledge. Such representation is composed of a set of objects and a set of is-a links between nodes. Objects are generally defined by means of a set of properties. An inheritance mechanism enables us to share properties across the hierarchy, called an inheritance graph. It is often difficult, even impossible to define classes by means of a set of necessary and sufficient conditions. For this reason, exceptions must be allowed and they induce nonmonotonic reasoning. Many researchers have used default logic to give them formal semantics and to define sound inferences. In this paper, we propose a survey of the different models of nonmonotonic inheritance systems by means of default logic. A comparison between default theories and inheritance mechanisms is made. In conclusion, the ability of default logic to take some inheritance mechanisms into account is discussed.

scholarly journals Eisenstein series and an asymptotic for the K-Bessel function

2021 ◽  
Author(s):  
Jimmy Tseng
Keyword(s):  
Asymptotic Expansion ◽  
Bessel Function ◽  
Eisenstein Series ◽  
Uniform Estimate ◽  
Positive Real ◽  
Dominant Term ◽  
Complex Order ◽  
Fixed Parameter ◽  
Real Argument ◽  
Real Analytic

AbstractWe produce an estimate for the K-Bessel function $$K_{r + i t}(y)$$ K r + i t ( y ) with positive, real argument y and of large complex order $$r+it$$ r + i t where r is bounded and $$t = y \sin \theta $$ t = y sin θ for a fixed parameter $$0\le \theta \le \pi /2$$ 0 ≤ θ ≤ π / 2 or $$t= y \cosh \mu $$ t = y cosh μ for a fixed parameter $$\mu >0$$ μ > 0 . In particular, we compute the dominant term of the asymptotic expansion of $$K_{r + i t}(y)$$ K r + i t ( y ) as $$y \rightarrow \infty $$ y → ∞ . When t and y are close (or equal), we also give a uniform estimate. As an application of these estimates, we give bounds on the weight-zero (real-analytic) Eisenstein series $$E_0^{(j)}(z, r+it)$$ E 0 ( j ) ( z , r + i t ) for each inequivalent cusp $$\kappa _j$$ κ j when $$1/2 \le r \le 3/2$$ 1 / 2 ≤ r ≤ 3 / 2 .

scholarly journals Fixed-Parameter Algorithms for Unsplittable Flow Cover

2021 ◽  
Author(s):  
Andrés Cristi ◽  
Mathieu Mari ◽  
Andreas Wiese
Keyword(s):  
Fixed Parameter ◽  
Unsplittable Flow
Sign in / Sign up

Export Citation Format

Share Document