Query Answering with Inconsistent Existential Rules under Stable Model Semantics
Authors: Hai Wan, Heng Zhang, Peng Xiao, Haoran Huang, Yan Zhang
AAAI 2016 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | An experimental evaluation shows that these approaches have good scalability of query answering under rule repairs on realistic cases. ... Experimental Evaluation To demonstrate the effectiveness, we have implemented a prototype system for query answering of R-acyclic rule languages under the rule-repair semantics w.r.t. , P , P and w, by calling a state-of-the-art ASP solver. |
| Researcher Affiliation | Academia | 1School of Data and Computer Science, Sun Yat-sen University, Guangzhou, China wanhai@mail.sysu.edu.cn 2School of Computer Science and Technology, Huazhong University of Science and Technology, Wuhan, China hengzhang@hust.edu.cn 3School of Computer Science, Fudan University, Shanghai, China 4School of Computing, Engineering and Mathematics, Western Sydney University, Sydney, Australia |
| Pseudocode | Yes | Algorithm 1: PRQA(D, O, Q) |
| Open Source Code | Yes | We developed a prototype system QAIER1 (Query Answering with Inconsistent Existential Rules) in C++. ... 1http://ss.sysu.edu.cn/%7ewh/qaier.html |
| Open Datasets | Yes | We use the modified LUBM3 as a benchmark. Because LUBM is not R-acyclic, we modified LUBM by changing atoms and deleting rules to make sure that modified LUBM is R-acyclic. ... 3LUBM. http://swat.cse.lehigh.edu/projects/lubm/ |
| Dataset Splits | No | The paper does not explicitly describe train/validation/test dataset splits. It describes generating or using datasets for performance evaluation, but not partitioning them into distinct training, validation, and test sets in the typical machine learning sense. |
| Hardware Specification | Yes | All experiments run in Linux Ubuntu 14.04.1 LTS on a HP compaq 8200 elite with a 3.4GHz Intel Core i7 and 4G 1333 MHz memory. |
| Software Dependencies | Yes | QAIER invokes an ASP solver clingo-4.4.02. ... All experiments run in Linux Ubuntu 14.04.1 LTS |
| Experiment Setup | Yes | To estimate the performance of QAIER in a view of data complexity, we use the modified LUBM3 as a benchmark. ... We use the EUDG5 to generate a database. By d Xt Y (Table 2) we mean that the instance involves X thousands facts and Y unreliable rules. ... For the performance in the view of combined complexity, we use the modified Ch EBI (Magka, Kr otzsch, and Horrocks 2013) as a benchmark. By c Xt Y (Table 3) we mean that the instance involves X molecules and chemical classes and Y unreliable rules. ... Each instance is computed three times and taken the average. |