@inproceedings{heymans2010flogic, author = {Heymans, Stijn and Korf, Roman and Erdmann, Michael and Puehrer, Joerg and Eiter, Thomas}, title = {F-Logic: Loosely Coupling F-Logic Rules and Ontologies}, booktitle = {Proc. of the 2010 IEEE/WIC/ACM International Conference on Web Intelligence}, year = {2010}, note = {Accepted for Publication}, url = {http://www.kr.tuwien.ac.at/staff/heymans/priv/publications/wi2010.pdf}, keywords = {ontologies, toread} }

%0 = inproceedings %A = Heymans, Stijn and Korf, Roman and Erdmann, Michael and Puehrer, Joerg and Eiter, Thomas %B = Proc. of the 2010 IEEE/WIC/ACM International Conference on Web Intelligence %D = 2010 %T = F-Logic: Loosely Coupling F-Logic Rules and Ontologies %U = http://www.kr.tuwien.ac.at/staff/heymans/priv/publications/wi2010.pdf

@inproceedings{DBLP:conf/esws/EiterIST06, author = {Eiter, Thomas and Ianni, Giovambattista and Schindlauer, Roman and Tompits, Hans}, title = {Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning.}, booktitle = {ESWC}, year = {2006}, pages = {273-287}, keywords = {reason, european, rules, proceedings, 2006, semantic, conference, eswc, and, web} }

%0 = inproceedings %A = Eiter, Thomas and Ianni, Giovambattista and Schindlauer, Roman and Tompits, Hans %B = ESWC %D = 2006 %T = Effective Integration of Declarative Rules with External Evaluations for Semantic-Web Reasoning.

The paper considers two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, and discusses their significance for several search problems in applied computer science. Hypergraph saturation (i.e., given a hypergraph $l H$, decide if every subset of vertices is contained in or contains some edge of $l H$) is shown to be co-NP-complete. A certain subproblem of hypergraph saturation, the saturation of simple hypergraphs (i.e., Sperner families), is shown to be under polynomial transformation equivalent to transversal hypergraph recognition; i.e., given two hypergraphs $l H_1, l H_2$, decide if the sets in $l H_2$ are all the minimal transversals of $l H_1$. The complexity of the search problem related to the recognition of the transversal hypergraph, the computation of the transversal hypergraph, is an open problem. This task needs time exponential in the input size; it is unknown whether an output-polynomial algorithm exists. For several important subcases, for instance if an upper or lower bound is imposed on the edge size or for acyclic hypergraphs, output-polynomial algorithms are presented. Computing or recognizing the minimal transversals of a hypergraph is a frequent problem in practice, which is pointed out by identifying important applications in database theory, Boolean switching theory, logic, and artificial intelligence (AI), particularly in model-based diagnosis.

@article{219403, author = {Eiter, Thomas and Gottlob, Georg}, title = {Identifying the Minimal Transversals of a Hypergraph and Related Problems}, journal = {SIAM J. Comput.}, publisher = {Society for Industrial and Applied Mathematics}, address = {Philadelphia, PA, USA}, year = {1995}, volume = {24}, number = {6}, pages = {1278--1304}, url = {http://portal.acm.org/citation.cfm?id=219403}, doi = {http://dx.doi.org/10.1137/S0097539793250299}, issn = {0097-5397}, keywords = {conp, theory, hypergraph, complexity}, abstract = {The paper considers two decision problems on hypergraphs, hypergraph saturation and recognition of the transversal hypergraph, and discusses their significance for several search problems in applied computer science. Hypergraph saturation (i.e., given a hypergraph $l H$, decide if every subset of vertices is contained in or contains some edge of $l H$) is shown to be co-NP-complete. A certain subproblem of hypergraph saturation, the saturation of simple hypergraphs (i.e., Sperner families), is shown to be under polynomial transformation equivalent to transversal hypergraph recognition; i.e., given two hypergraphs $l H_1, l H_2$, decide if the sets in $l H_2$ are all the minimal transversals of $l H_1$. The complexity of the search problem related to the recognition of the transversal hypergraph, the computation of the transversal hypergraph, is an open problem. This task needs time exponential in the input size; it is unknown whether an output-polynomial algorithm exists. For several important subcases, for instance if an upper or lower bound is imposed on the edge size or for acyclic hypergraphs, output-polynomial algorithms are presented. Computing or recognizing the minimal transversals of a hypergraph is a frequent problem in practice, which is pointed out by identifying important applications in database theory, Boolean switching theory, logic, and artificial intelligence (AI), particularly in model-based diagnosis.} }

%0 = article %A = Eiter, Thomas and Gottlob, Georg %C = Philadelphia, PA, USA %D = 1995 %I = Society for Industrial and Applied Mathematics %T = Identifying the Minimal Transversals of a Hypergraph and Related Problems %U = http://portal.acm.org/citation.cfm?id=219403