
-
SNN under Attack: are Spiking Deep Belief Networks vulnerable to Adversarial Examples?
Recently, many adversarial examples have emerged for Deep Neural Network...
read it
-
Turbocharging Treewidth-Bounded Bayesian Network Structure Learning
We present a new approach for learning the structure of a treewidth-boun...
read it
-
On Uniform Equivalence of Epistemic Logic Programs
Epistemic Logic Programs (ELPs) extend Answer Set Programming (ASP) with...
read it
-
Best-Effort Inductive Logic Programming via Fine-grained Cost-based Hypothesis Generation
We describe the Inspire system which participated in the first competiti...
read it
-
Default Logic and Bounded Treewidth
In this paper, we study Reiter's propositional default logic when the tr...
read it
-
Marmara Turkish Coreference Corpus and Coreference Resolution Baseline
We describe the Marmara Turkish Coreference Corpus, which is an annotati...
read it
-
Stepwise Debugging of Answer-Set Programs
We introduce a stepping methodology for answer-set programming (ASP) tha...
read it
-
Encoding monotonic multi-set preferences using CI-nets: preliminary report
CP-nets and their variants constitute one of the main AI approaches for ...
read it
-
Stream Reasoning-Based Control of Caching Strategies in CCN Routers
Content-Centric Networking (CCN) research addresses the mismatch between...
read it
-
Unsupervised Feature Learning for Writer Identification and Writer Retrieval
Deep Convolutional Neural Networks (CNN) have shown great success in sup...
read it
-
Complexity Results for Manipulation, Bribery and Control of the Kemeny Procedure in Judgment Aggregation
We study the computational complexity of several scenarios of strategic ...
read it
-
The Power of Non-Ground Rules in Answer Set Programming
Answer set programming (ASP) is a well-established logic programming lan...
read it
-
The DLVHEX System for Knowledge Representation: Recent Advances (System Description)
The DLVHEX system implements the HEX-semantics, which integrates answer ...
read it
-
READ-BAD: A New Dataset and Evaluation Scheme for Baseline Detection in Archival Documents
Text line detection is crucial for any application associated with Autom...
read it
-
Clique-Width and Directed Width Measures for Answer-Set Programming
Disjunctive Answer Set Programming (ASP) is a powerful declarative progr...
read it
-
Reactive Policies with Planning for Action Languages
We describe a representation in a high-level transition system for polic...
read it
-
Using Enthymemes to Fill the Gap between Logical Argumentation and Revision of Abstract Argumentation Frameworks
In this paper, we present a preliminary work on an approach to fill the ...
read it
-
Strong Backdoors for Default Logic
In this paper, we introduce a notion of backdoors to Reiter's propositio...
read it
-
Towards Ideal Semantics for Analyzing Stream Reasoning
The rise of smart applications has drawn interest to logical reasoning o...
read it
-
Deep Neural Programs for Adaptive Control in Cyber-Physical Systems
We introduce Deep Neural Programs (DNP), a novel programming paradigm fo...
read it
-
A Formal Methods Approach to Pattern Synthesis in Reaction Diffusion Systems
We propose a technique to detect and generate patterns in a network of l...
read it
-
Managing Change in Graph-structured Data Using Description Logics (long version with appendix)
In this paper, we consider the setting of graph-structured data that evo...
read it
-
On the Robustness of Temporal Properties for Stochastic Models
Stochastic models such as Continuous-Time Markov Chains (CTMC) and Stoch...
read it
-
Parameterized Complexity Results for Plan Reuse
Planning is a notoriously difficult computational problem of high worst-...
read it
-
Backdoors to Abduction
Abductive reasoning (or Abduction, for short) is among the most fundamen...
read it
-
Backdoors to Normality for Disjunctive Logic Programs
Over the last two decades, propositional satisfiability (SAT) has become...
read it
-
Utilizing ASP for Generating and Visualizing Argumentation Frameworks
Within the area of computational models of argumentation, the instantiat...
read it
-
Annotating Answer-Set Programs in LANA?
While past research in answer-set programming (ASP) mainly focused on th...
read it
-
The Complexity of Planning Revisited - A Parameterized Analysis
The early classifications of the computational complexity of planning un...
read it
-
On Finding Optimal Polytrees
Inferring probabilistic networks from data is a notoriously difficult ta...
read it
-
Multimodal Classification of Events in Social Media
A large amount of social media hosted on platforms like Flickr and Insta...
read it
-
Strong Backdoors to Nested Satisfiability
Knuth (1990) introduced the class of nested formulas and showed that the...
read it
-
The Good, the Bad, and the Odd: Cycles in Answer-Set Programs
Backdoors of answer-set programs are sets of atoms that represent clever...
read it
-
Strong Equivalence of Qualitative Optimization Problems
We introduce the framework of qualitative optimization problems (or, sim...
read it
-
Embedding Description Logic Programs into Default Logic
Description logic programs (dl-programs) under the answer set semantics ...
read it
-
Backdoors to Satisfaction
A backdoor set is a set of variables of a propositional formula such tha...
read it
-
Backdoors to Acyclic SAT
Backdoor sets, a notion introduced by Williams et al. in 2003, are certa...
read it
-
The SeaLion has Landed: An IDE for Answer-Set Programming---Preliminary Report
We report about the current state and designated features of the tool Se...
read it
-
Domain-specific Languages in a Finite Domain Constraint Programming System
In this paper, we present domain-specific languages (DSLs) that we devis...
read it
-
Parsing Combinatory Categorial Grammar with Answer Set Programming: Preliminary Report
Combinatory categorial grammar (CCG) is a grammar formalism used for nat...
read it
-
Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems
Dung's famous abstract argumentation frameworks represent the core forma...
read it
-
Finding Similar/Diverse Solutions in Answer Set Programming
For some computational problems (e.g., product configuration, planning, ...
read it
-
Compressive Nonparametric Graphical Model Selection For Time Series
We propose a method for inferring the conditional indepen- dence graph (...
read it
-
Confidence Sets Based on Thresholding Estimators in High-Dimensional Gaussian Regression Models
We study confidence intervals based on hard-thresholding, soft-threshold...
read it
-
Augmenting Tractable Fragments of Abstract Argumentation
We present a new and compelling approach to the efficient solution of im...
read it
-
Backdoors to Tractable Answer-Set Programming
Answer Set Programming (ASP) is an increasingly popular framework for de...
read it
-
Kernels for Global Constraints
Bessiere et al. (AAAI'08) showed that several intractable global constra...
read it
-
Using Dimension Reduction to Improve the Classification of High-dimensional Data
In this work we show that the classification performance of high-dimensi...
read it
-
Relativized hyperequivalence of logic programs for modular programming
A recent framework of relativized hyperequivalence of programs offers a ...
read it
-
Characterising equilibrium logic and nested logic programs: Reductions and complexity
Equilibrium logic is an approach to nonmonotonic reasoning that extends ...
read it