Home
EPiC Series
Kalpa Publications
Preprints
For Authors
For Editors
Keyword
:
complexity
Papers
Optimal ABox Repair W.R.T. Static EL TBoxes: from Quantified ABoxes Back to ABoxes (Extended Abstract)
Franz Baader
,
Patrick Koopmann
,
Francesco Kriegel
and
Adrian Nuradiansyah
EasyChair Preprint no. 8542
The Effect of Marketing Investment on Firm Value and Systematic Risk
Musaab Mousa
,
Saeed Nosratabadi
,
Judit Sagi
and
Amir Mosavi
EasyChair Preprint no. 5419
Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard
Mnacho Echenim
,
Radu Iosif
and
Nicolas Peltier
EasyChair Preprint no. 4877
The Polyhedral Structure and Complexity of Multistage Stochastic Linear Problem with General Cost Distribution
Maël Forcier
,
Stéphane Gaubert
and
Vincent Leclère
EasyChair Preprint no. 4113
Entailment Checking in Separation Logic with Inductive Definitions is 2-EXPTIME hard
Mnacho Echenim
,
Radu Iosif
and
Nicolas Peltier
In
:
LPAR23. LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
Finding Small Proofs for Description Logic Entailments: Theory and Practice
Christian Alrabbaa
,
Franz Baader
,
Stefan Borgwardt
,
Patrick Koopmann
and
Alisa Kovtunova
In
:
LPAR23. LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
Description Logics That Count, and What They Can and Cannot Count
Franz Baader
and
Filippo De Bortoli
In
:
ANDREI-60. Automated New-era Deductive Reasoning Event in Iberia
Linearization Techniques to Overcome Nonlinear Effects of RF Power Amplifier in Mobile Communication
S. Puneeth
and
H. G. Rangaraju
EasyChair Preprint no. 2364
On Some Classes of Problems on Graphs
Volodymyr G. Skobelev
EasyChair Preprint no. 1156
The hardness of minimizing design cost subject to planning problems
Fatemeh Zahra Saberifar
,
Jason M. O'Kane
and
Dylan A. Shell
EasyChair Preprint no. 743
A Verified Efficient Implementation of the LLL Basis Reduction Algorithm
Ralph Bottesch
,
Max W. Haslbeck
and
René Thiemann
In
:
LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
Matching in the Description Logic FL0 with respect to General TBoxes
Franz Baader
,
Oliver Fernandez Gil
and
Pavlos Marantidis
In
:
LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
The Triguarded Fragment of First-Order Logic
Sebastian Rudolph
and
Mantas Simkus
In
:
LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
Investigating the Complexity of Runoff Series in the Yangtze River Using Sample Entropy
Yuankun Wang
,
Dong Wang
and
Xiaorui Shi
In
:
HIC 2018. 13th International Conference on Hydroinformatics
The Complexity of Prenex Separation Logic with One Selector
Mnacho Echenim
,
Radu Iosif
and
Nicolas Peltier
EasyChair Preprint no. 433
Education of Engineers – the Requiring of Pedagogy Development
Melany Ciampi
,
Claudio Brito
,
Henrique Santos
,
Rosa Vasconcelos
and
Luis Amaral
EasyChair Preprint no. 232
Extending the Description Logic ALC with More Expressive Cardinality Constraints on Concepts
Franz Baader
and
Andreas Ecke
In
:
GCAI 2017. 3rd Global Conference on Artificial Intelligence
On the Interaction of Inclusion Dependencies with Independence Atoms
Miika Hannula
,
Juha Kontinen
and
Sebastian Link
In
:
LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning
On the Complexity of Fixed-Size Bit-Vector Logics with Binary Encoded Bit-Width
Gergely Kovásznai
,
Andreas Fröhlich
and
Armin Biere
In
:
SMT 2012. 10th International Workshop on Satisfiability Modulo Theories
Complexity of LTL Model-Checking for Safe Object Nets
Michael Köhler-Bußmeier
and
Frank Heitmann
In
:
LAM'10. 3rd International Workshop on Logics, Agents, and Mobility
Copyright © 2012-2023 easychair.org. All rights reserved.