[HTML][HTML] Computational aspects of monotone dualization: A brief survey
Dualization of a monotone Boolean function represented by a conjunctive normal form
(CNF) is a problem which, in different disguise, is ubiquitous in many areas including …
(CNF) is a problem which, in different disguise, is ubiquitous in many areas including …
New results on monotone dualization and generating hypergraph transversals
This paper considers the problem of dualizing a monotone CNF (equivalently, computing all
minimal transversals of a hypergraph), whose associated decision problem is a prominent …
minimal transversals of a hypergraph), whose associated decision problem is a prominent …
Hypergraph transversal computation and related problems in logic and AI
Generating minimal transversals of a hypergraph is an important problem which has many
applications in Computer Science. In the present paper, we address this problem and its …
applications in Computer Science. In the present paper, we address this problem and its …
Efficient enumeration of maximal k-plexes
The problem of enumerating (ie, generating) all maximal cliques in a graph has received
extensive treatment, due to the plethora of applications in various areas such as data …
extensive treatment, due to the plethora of applications in various areas such as data …
Computing and explaining query answers over inconsistent DL-Lite knowledge bases
Several inconsistency-tolerant semantics have been introduced for querying inconsistent
description logic knowledge bases. The first contribution of this paper is a practical approach …
description logic knowledge bases. The first contribution of this paper is a practical approach …
Enumeration of enumeration algorithms
K Wasa - arXiv preprint arXiv:1605.05102, 2016 - arxiv.org
arXiv:1605.05102v2 [cs.DS] 25 May 2016 Page 1 arXiv:1605.05102v2 [cs.DS] 25 May 2016
Enumeration of Enumeration Algorithms Kunihiro Wasa∗ May 26, 2016 Abstract In this paper …
Enumeration of Enumeration Algorithms Kunihiro Wasa∗ May 26, 2016 Abstract In this paper …
Querying and repairing inconsistent prioritized knowledge bases: Complexity analysis and links with abstract argumentation
M Bienvenu, C Bourgaux - arXiv preprint arXiv:2003.05746, 2020 - arxiv.org
In this paper, we explore the issue of inconsistency handling over prioritized knowledge
bases (KBs), which consist of an ontology, a set of facts, and a priority relation between …
bases (KBs), which consist of an ontology, a set of facts, and a priority relation between …
C-exact hypergraphs in concurrency and sequentiality analyses of cyber-physical systems specified by safe Petri nets
R Wiśniewski, M Wiśniewska, M Jarnut - IEEE Access, 2019 - ieeexplore.ieee.org
The paper proposes the novel concurrency and sequentiality analysis techniques of a cyber-
physical system specified by a safe Petri net. The presented methods are based on the …
physical system specified by a safe Petri net. The presented methods are based on the …
[PDF][PDF] Complexity of Abduction in the EL Family of Lightweight Description Logics.
M Bienvenu - KR, 2008 - cdn.aaai.org
The complexity of logic-based abduction has been extensively studied for the case in which
the background knowledge is represented by a propositional theory, but very little is known …
the background knowledge is represented by a propositional theory, but very little is known …
Dual-bounded generating problems: All minimal integer solutions for a monotone system of linear inequalities
We consider the problem of enumerating all minimal integer solutions of a monotone system
of linear inequalities. We first show that, for any monotone system of r linear inequalities in n …
of linear inequalities. We first show that, for any monotone system of r linear inequalities in n …