TU Wien Informatics

Overview
Services
Office of the Dean Infrastructure Communications eduLAB
Institutes
Computer Engineering Information Systems Engineering Logic and Computation Visual Computing and Human-Centered Technology
Research Units
Algorithms and Complexity Artifact-based Computing and User Research Artificial Intelligence Techniques Automation Systems Business Informatics Compilers and Languages Computer Graphics Computer Vision Cyber-Physical Systems Data Science Databases and Artificial Intelligence Distributed Systems Embedded Computing Systems Formal Methods in Systems Engineering Human Computer Interaction Knowledge-Based Systems Machine Learning Parallel Computing Security and Privacy Software Engineering Theory and Logic Virtual and Augmented Reality Visual Analytics

Knowledge-Based Systems E192-03

  • A Research Unit of The Institute of Logic and Computation

Our major research topic are programming languages for knowledge, including how to represent knowledge in an understandable and intuitive way, and how to process it in an inferential manner, by manipulating chunks of knowledge in symbolic form.

Research Unit Knowledge-Based Systems

Contact

On This Page

About People Activities

About

Our major research topic are programming languages for knowledge, including how to represent knowledge in an understandable and intuitive way, and how to process it in an inferential manner, by manipulating chunks of knowledge in symbolic form.

The goal of our research is to gain insight into these questions and to obtain fundamental results, to develop algorithms, and to build prototype implementations of tools for knowledge representation and reasoning.

To this end, we use methods from mathematics, theoretical computer science, and logic (formal analysis), engineering (algorithms and prototypes), as well as statistics and cognitive science (evaluation).

For more information, see our research area description.

The research Unit Knowledge-Based Systems is part of the Institute of Logic and Computation.

Uwe Egly
Uwe Egly U. Egly

Associate Professor
Ao.Univ.Prof. DI Dr.

Thomas Eiter
Thomas Eiter T. Eiter

Head of Research Unit
O.Univ.Prof. DI Dr.

Maria Magdalena Ortiz de la Fuente
Maria Magdalena Ortiz de la Fuente M. Ortiz de la Fuente

Associate Professor
Assoc.Prof. Dr. / MSc

Hans Tompits
Hans Tompits H. Tompits

Associate Professor
Ao.Univ.Prof. Mag. Dr.

Sebastian Philipp Adam
Sebastian Philipp Adam S. Adam

PreDoc Researcher
DI / BSc

Shqiponja Ahmetaj
Shqiponja Ahmetaj S. Ahmetaj

PostDoc Researcher
Dr. / MSc MSc

Michele Collevati
Michele Collevati M. Collevati

PreDoc Researcher
Mag.

Tobias Geibinger
Tobias Geibinger T. Geibinger

PreDoc Researcher
DI / BSc

Nelson Nicolas Higuera Ruiz
Nelson Nicolas Higuera Ruiz N. Higuera Ruiz

PreDoc Researcher

Johannes Oetsch
Johannes Oetsch J. Oetsch

PostDoc Researcher
DI Dr. / BSc

Anouk Michelle Oudshoorn
Anouk Michelle Oudshoorn A. Oudshoorn

PreDoc Researcher
MSc

Davide Solda
Davide Solda D. Solda

PreDoc Researcher
Mag.

Eva Nedoma
Eva Nedoma E. Nedoma

Office Services

Matthias Schlögel
Matthias Schlögel M. Schlögel

IT Services
ADir

2023W

2024S

 

2023

2022

  • Enhancing AI Capabilities by Rules: Challenges and Opportunities / Eiter, T. (2022, December 13). Enhancing AI Capabilities by Rules: Challenges and Opportunities [Conference Presentation]. 9th International Chinese Scholar Workshop on Knowledge Representation and Reasoning, Guiyang, Guizhou, China. http://hdl.handle.net/20.500.12708/153923
  • Elaboration for Neurosymbolic Compuation / Eiter, T., & Higuera Ruiz, N. N. (2022, November 29). Elaboration for Neurosymbolic Compuation [Conference Presentation]. TAASP - Workshop on Trends and Applications of Answer Set Programming, Wien, Austria.
  • Witnesses for Answer Sets of Logic Programs / Wang, Y., Eiter, T., Yuanlin Zhang, & Lin, F. (2022, November 29). Witnesses for Answer Sets of Logic Programs [Conference Presentation]. TAASP - Workshop on Trends and Applications of Answer Set Programming, Wien, Austria. http://hdl.handle.net/20.500.12708/154231
  • Representing Normative Reasoning in Answer Set Programming Using Weak Constraints / Hatschka, C., Ciabattoni, A., & Eiter, T. (2022, November 28). Representing Normative Reasoning in Answer Set Programming Using Weak Constraints [Conference Presentation]. TAASP - Workshop on Trends and Applications of Answer Set Programming, Wien, Austria. http://hdl.handle.net/20.500.12708/154091
  • ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser (Extended Abstract) / Eiter, T., Geibinger, T., Higuera, N., Musliu, N., Oetsch, J., & Stepanova, D. (2022). ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser (Extended Abstract). In Proceedings of the 5th Workshop on Trends and Applications of Answer Set Programming. 5th Workshop on Trends and Applications of Answer Set Programming, Vienna, Austria.
  • Formalizing Property Constraints in Wikidata / Ferranti, N., Polleres, A., de Souza, J. F., & Ahmetaj, S. (2022). Formalizing Property Constraints in Wikidata. In Proceedings of the 3rd Wikidata Workshop 2022. Wikidata Workshop 2022, Hangzhou, China. http://hdl.handle.net/20.500.12708/150282
    Project: FRESH (2021–2025)
  • Enhancing AI Capabilities by Rules: Applications and Opportunities / Eiter, T. (2022, November 4). Enhancing AI Capabilities by Rules: Applications and Opportunities [Conference Presentation]. CS Seminar, Binghamton, New York, United States of America (the).
  • Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures (Extended Abstract) / Bozzato, L., Eiter, T., & Kiesel, R. P. D. (2022). Reasoning on Multi-Relational Contextual Hierarchies via Answer Set Programming with Algebraic Measures (Extended Abstract). In Proceedings of the 35th International Workshop on Description Logics (DL 2022) co-located with Federated Logic Conference (FLoC 2022). 35th International Workshop on Description Logics (DL 2022), Haifa, Israel.
  • Enhancing AI Capabilities by Rules: Applications and Opportunities / Eiter, T. (2022, October 18). Enhancing AI Capabilities by Rules: Applications and Opportunities [Presentation]. interne Veranstaltung des Bosch Labs, Renningen, Germany.
  • Repairing SHACL Constraint Violations Using Answer Set Programming / Ahmetaj, S., David, R., Polleres, A., & Simkus, M. (2022). Repairing SHACL Constraint Violations Using Answer Set Programming. In The Semantic Web – ISWC 2022 (pp. 375–391). Springer. https://doi.org/10.1007/978-3-031-19433-7\_22
    Projects: FRESH (2021–2025) / KtoAPP (2018–2025) / OMEGA (2017–2022)
  • Implementations for Shor's algorithm for the DLP / Mandl, A., & Egly, U. (2022). Implementations for Shor’s algorithm for the DLP. In 52. Jahrestagung der Gesellschaft für Informatik (pp. 1133–1143). Gesellschaft für Informatik. https://doi.org/10.18420/inf2022_96
  • Magic Shapes for SHACL Validation / Ahmetaj, S., Löhnert, B., Ortiz de la Fuente, M. M., & Simkus, M. (2022). Magic Shapes for SHACL Validation. Proceedings of the VLDB Endowment, 15(10), 2284--2296. https://doi.org/10.14778/3547305.3547329
    Projects: FRESH (2021–2025) / KtoAPP (2018–2025) / OMEGA (2017–2022)
  • Introduction to the Collection of Papers Celebrating the 20th Anniversary of TPLP / EITER, T., MAHER, M., PONTELLI, E., DE RAEDT, L., & TRUSZCZYNSKI, M. (2022). Introduction to the Collection of Papers Celebrating the 20th Anniversary of TPLP. Theory and Practice of Logic Programming, 22(6), 770–775. https://doi.org/10.1017/S1471068422000345
  • Large-Neighbourhood Search for Optimisation in Answer-Set Solving (Extended Abstract) / Eiter, T., Geibinger, T., Higuera Ruiz, N., Musliu, N., Oetsch, J., & Stepanova, D. (2022). Large-Neighbourhood Search for Optimisation in Answer-Set Solving (Extended Abstract). In Proceedings of the 38th International Conference on Logic Programming. 38th International Conference on Logic Programming, Haifa, Israel. Open Publishing Association. http://hdl.handle.net/20.500.12708/139851
  • History of KR: A Personal View / Eiter, T. (2022, July 11). History of KR: A Personal View [Presentation]. Current and Future Challenges in Knowledge Representation and Reasoning, Schloss Dagstuhl, Germany.
  • An Open Challenge for Exact Job Scheduling with Reticle Batching in Photolithography / Eiter, T., Geibinger, T., Gisbrecht, A., Higuera Ruiz, N. N., Musliu, N., Oetsch, J., & Stepanova, D. (2022). An Open Challenge for Exact Job Scheduling with Reticle Batching in Photolithography. In KEPS 2022 Workshop on Knowledge Engineering for Planning and Scheduling. Workshop on Knowledge Engineering for Planning and Scheduling, International. http://hdl.handle.net/20.500.12708/139763
  • From Truth Degree Comparison Games to Sequents-of-Relations Calculi for Gödel Logic / Fermüller, C., Lang, T. A., & Pavlova, A. (2022). From Truth Degree Comparison Games to Sequents-of-Relations Calculi for Gödel Logic. Logica Universalis, 16(1–2), 221–235. https://doi.org/10.1007/s11787-022-00300-0
    Download: PDF (409 KB)
    Project: SEGACAB (2019–2023)
  • Cross-Industry Overview of Fault-Tolerant Approaches used in Autonomous Systems / Horeis, T. F., Plinke, F., Kain, T., Tompits, H., Rinaldo, R. C., & Heinrich, J. (2022). Cross-Industry Overview of Fault-Tolerant Approaches used in Autonomous Systems. In Proceedings of the 35th VDI-Fachtagung Fahrerassistenzsysteme und Automatisiertes Fahren (pp. 89–108).
  • A Confidence-Based Interface for Neuro-Symbolic Visual Question Answering / Eiter, T., Oetsch, J., Pritz, M., & Higuera Ruiz, N. N. (2022, February 28). A Confidence-Based Interface for Neuro-Symbolic Visual Question Answering [Poster Presentation]. First International Workshop on Combining Learning and Reasoning: Programming Languages, Formalisms, and Representations (CLeaR 2022), Vancouver, Canada.
  • (Non-)Convergence Results for Predictive Coding Networks / Frieder, S., & Lukasiewicz, T. (2022). (Non-)Convergence Results for Predictive Coding Networks. In Proceedings of the 39th International Conference on Machine Learning (pp. 6793–6810). http://hdl.handle.net/20.500.12708/187543
  • ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser / Eiter, T., Geibinger, T., Higuera, N., Musliu, N., Oetsch, J., & Stepanova, D. (2022). ALASPO: An Adaptive Large-Neighbourhood ASP Optimiser. In G. Kern-Isberner, G. Lackemeyer, & T. Meyer (Eds.), Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning — Applications and Systems (pp. 565–569). IJCAI Organization. https://doi.org/10.24963/kr.2022/58
  • Abstraction for Non-Ground Answer Set Programs (Extended Abstract) / Saribatur, Z. G., Eiter, T., & Schüller, P. (2022). Abstraction for Non-Ground Answer Set Programs (Extended Abstract). In Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence (pp. 5767–5771). https://doi.org/10.24963/ijcai.2022/807
  • PAUL: An Algorithmic Composer for Classical Piano Music Supporting Multiple Complexity Levels / Schön, F., & Tompits, H. (2022). PAUL: An Algorithmic Composer for Classical Piano Music Supporting Multiple Complexity Levels. In Progress in Artificial Intelligence - 21st EPIA Conference on Artificial Intelligence, Proceedings (EPIA 2022) (pp. 415–426). Springer. https://doi.org/10.1007/978-3-031-16474-3_34
  • Reasoning on with Defeasibility in ASP / BOZZATO, L., EITER, T., & SERAFINI, L. (2022). Reasoning on  with Defeasibility in ASP. Theory and Practice of Logic Programming, 22(2), 254–304. https://doi.org/10.1017/S1471068421000132
  • A Neuro-Symbolic ASP Pipeline for Visual Question Answering / Eiter, T., Higuera Ruiz, N. N., Oetsch, J., & Pritz, M. (2022). A Neuro-Symbolic ASP Pipeline for Visual Question Answering. Theory and Practice of Logic Programming, 22(5), 739–754. https://doi.org/10.1017/S1471068422000229
  • A Qualitative Temporal Extension of Here-and-There Logic / Eiter, T., & Schneider, P. (2022). A Qualitative Temporal Extension of Here-and-There Logic. In Logic Programming and Nonmonotonic Reasoning: 16th International Conference, LPNMR 2022 (pp. 159–176). https://doi.org/10.1007/978-3-031-15707-3
  • Chasing Streams with Existential Rules / Urbani, J., Krötzsch, M., & Eiter, T. (2022). Chasing Streams with Existential Rules. In Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning — Applications and Systems (pp. 415–419). IJCAI Organization. https://doi.org/10.24963/kr.2022/43

2021

  • IoTCrawler: Challenges and Solutions for Searching the Internet of Things / Iggena, T., Ilyas, E. B., Fischer, M., Tönjes, R., Elsaleh, T., Rezvani, R., Pourshahrokhi, N., Bischof, S., Fernbach, A., Parreira, J., Schneider, P., Smirnov, P., Strohbach, M., Truong, H., García-González, A., Skarmeta, A. F., Singh, P., Beliatis, M. J., Presser, M., & Martinez, J. A. (2021). IoTCrawler: Challenges and Solutions for Searching the Internet of Things. Sensors, 21(5), 1559. https://doi.org/10.3390/s21051559
  • Beyond Uniform Equivalence between Answer-set Programs / Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2021). Beyond Uniform Equivalence between Answer-set Programs. ACM Transactions on Computational Logic, 22(1), 1–46. https://doi.org/10.1145/3422361
  • Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations / Bloem, R., Braud-Santoni, N., Hadzic, V., Egly, U., Lonsing, F., & Seidl, M. (2021). Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations. Formal Methods in System Design, 57(2), 157–177. https://doi.org/10.1007/s10703-021-00371-7
  • Deploying Spatial-Stream Query Answering in C-ITS Scenarios / Eiter, T., Ichise, R., Parreira, J. X., Schneider, P., & Zhao, L. (2021). Deploying Spatial-Stream Query Answering in C-ITS Scenarios. Semantic Web, 12(1), 41–77. https://doi.org/10.3233/sw-200408
    Project: DynaCon (2017–2020)
  • Quantitative and Stream Extensions of Answer Set Programming / Kiesel, R. (2021). Quantitative and Stream Extensions of Answer Set Programming. In Proceedings of the 37th International Conference on Logic Programming (ICLP 2021). 37th International Conference on Logic Programming (ICLP 2021), Porto, Portugal, EU. http://hdl.handle.net/20.500.12708/58732
  • Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting / Eiter, T., Hecher, M., & Kiesel, R. (2021). Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting. In Proceedings of the 37th International Conference on Logic Programming (ICLP 2021). 37th International Conference on Logic Programming (ICLP 2021), Porto, Portugal, EU. http://hdl.handle.net/20.500.12708/58728
    Projects: HYPAR (2019–2024) / START (2014–2022)
  • Ein Ansatz zur Wiederherstellung ausgefallener Hardwarekomponenten in Fail-Operational Architekturen - Eine Erweiterung von FDIRO / Kain, T., Mehlhorn, M. A., Horeis, T. F., Heinrich, J., & Tompits, H. (2021). Ein Ansatz zur Wiederherstellung ausgefallener Hardwarekomponenten in Fail-Operational Architekturen - Eine Erweiterung von FDIRO. In VDI Wissensforum GmbH (Ed.), Technische Zuverlässigkeit 2021 (pp. 297–308). VDI Verlag. http://hdl.handle.net/20.500.12708/58693
  • D-DEG: A Dynamic Cooperation-Based Approach for Reducing Resource Consumption in Autonomous Vehicles. / Kain, T., Mehlhorn, M. A., Müller, J.-S., & Tompits, H. (2021). D-DEG: A Dynamic Cooperation-Based Approach for Reducing Resource Consumption in Autonomous Vehicles. In B. Castanier, M. Cepin, & D. Bigaud (Eds.), Proceedings of the 31st European Safety and Reliability Conference (ESREL 2021) (pp. 2807–2817). Research Publishing Services. http://hdl.handle.net/20.500.12708/55680
  • C-PO: A Context-Based Application-Placement Optimization for Autonomous Vehicles / Tompits, H., Kain, T., Horeis, T. F., Heinrich, J., Müller, J.-S., Plinke, F., Decke, H., & Mehlhorn, M. A. (2021). C-PO: A Context-Based Application-Placement Optimization for Autonomous Vehicles. In IEEE (Ed.), 2021 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE. https://doi.org/10.23919/date51398.2021.9473948
  • Reasoning about Explanations for Non-validation in SHACL / Ahmetaj, S., David, R., Ortiz, M., Polleres, A., Shehu, B., & Šimkus, M. (2021). Reasoning about Explanations for Non-validation in SHACL. In Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning. KR 2021 - 18th International Conference on Principles of Knowledge Representation and Reasoning, virtual event, International. https://doi.org/10.24963/kr.2021/2
  • Reasoning about Explanations for Non-validation in SHACL (Extended abstract) / Ahmetaj, S., David, R., Ortiz de la Fuente, M. M., Polleres, A., Shehu, B., & Simkus, M. (2021). Reasoning about Explanations for Non-validation in SHACL (Extended abstract). In Proceedings of the 34th International Workshop on Description Logics (DL 2021). International Workshop on Description Logics (DL), Windermere, Lake District, UK, EU. CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55685
  • Reasoning on DL-LiteR with Defeasibility in ASP / BOZZATO, L., Eiter, T., & SERAFINI, L. (2021). Reasoning on DL-LiteR with Defeasibility in ASP. Theory and Practice of Logic Programming, 22(2), 254–304. https://doi.org/10.1017/s1471068421000132
  • Solving Configuration Problems with ASP and Declarative Domain Specific Heuristics / Taupe, R., Friedrich, G., Schekotihin, K., & Weinzierl, A. (2021). Solving Configuration Problems with ASP and Declarative Domain Specific Heuristics. In Proceedings of the 23rd International Configuration Workshop (CWS/ConfWS 2021) (p. 8). CEUR-WS. http://hdl.handle.net/20.500.12708/55694
    Project: DynaCon (2017–2020)
  • Reasoning on Multirelational Contextual Hierarchies via Answer Set Programming with Algebraic Measures / Bozatto, L., Eiter, T., & Kiesel, R. P. D. (2021). Reasoning on Multirelational Contextual Hierarchies via Answer Set Programming with Algebraic Measures. Theory and Practice of Logic Programming, 21(5), 593–609. https://doi.org/10.1017/s1471068421000284
  • Omission-Based Abstraction for Answer Set Programs - ERRATUM / SARIBATUR, Z. G., & EITER, T. (2021). Omission-Based Abstraction for Answer Set Programs - ERRATUM. Theory and Practice of Logic Programming, 21(2), 292–292. https://doi.org/10.1017/s1471068420000125
  • Pruning external minimality checking for answer set programs using semantic dependencies / Eiter, T., & Kaminski, T. (2021). Pruning external minimality checking for answer set programs using semantic dependencies. Artificial Intelligence, 290(103402), 103402. https://doi.org/10.1016/j.artint.2020.103402
  • Abstraction for non-ground answer set programs / Saribatur, Z. G., Eiter, T., & Schüller, P. (2021). Abstraction for non-ground answer set programs. Artificial Intelligence, 300(103563), 103563. https://doi.org/10.1016/j.artint.2021.103563
    Projects: AI4EU (2019–2021) / HumanE-AI-Net (2020–2024)
  • Combining Task and Motion Planning: Challenges and Guidelines / Mansouri, M., Pecora, F., & Schüller, P. (2021). Combining Task and Motion Planning: Challenges and Guidelines. Frontiers in Robotics and AI, 8. https://doi.org/10.3389/frobt.2021.637888
    Project: AI4EU (2019–2021)
  • Ontologies for On-Demand Designof Data-Centric Systems / Ortiz de la Fuente, M. M. (2021). Ontologies for On-Demand Designof Data-Centric Systems. In Formal Concept Analysis. International Conference on Formal Concept Analysis ICFCA, Strasbourg, France, EU. Springer Lecture Notes in Computer Science. http://hdl.handle.net/20.500.12708/55671
  • How Hard to Tell? Complexity of Belief Manipulation Through Propositional Announcements / Eiter, T., Hunter, A., & Schwarzentruber, F. (2021). How Hard to Tell? Complexity of Belief Manipulation Through Propositional Announcements. In Z.-H. Zhou (Ed.), Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI. https://doi.org/10.24963/ijcai.2021/257
  • Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling / Eiter, T., Geibinger, T., Musliu, N., Oetsch, J., Skočovský, P., & Stepanova, D. (2021). Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling. In Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning. KR 2021 - 18th International Conference on Principles of Knowledge Representation and Reasoning, virtual event, International. https://doi.org/10.24963/kr.2021/27
    Project: KIRAS-PrEMI (2019–2022)
  • Turbocharging Treewidth-Bounded Bayesian Network Structure Learning / Ramaswamy, V. P., & Szeider, S. (2021). Turbocharging Treewidth-Bounded Bayesian Network Structure Learning. In Thirty-Fifth AAAI Conference on Artificial Intelligence (pp. 3895–3903). AAAI Press. http://hdl.handle.net/20.500.12708/58598
  • Overcoming the Grounding Bottleneck Due to Constraints in ASP Solving: Constraints Become Propagators / Cuteri, B., Dodaro, C., Ricca, F., & Schüller, P. (2021). Overcoming the Grounding Bottleneck Due to Constraints in ASP Solving: Constraints Become Propagators. In C. Bessiere (Ed.), Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence. ijcai.org. https://doi.org/10.24963/ijcai.2020/234
  • Magic Shapes for Validation in SHACL / Ahmetaj, S., Loehnert, B., Ortiz de la Fuente, M. M., & Simkus, M. (2021). Magic Shapes for Validation in SHACL. In Proceedings of the ISWC 2021 Posters, Demos and Industry Tracks: From Novel Ideas to Industrial Practice co-located with 20th International Semantic Web Conference (ISWC 2021). ISWC 2021 - The 20th International Semantic Web Conference, online event, International. CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55686
  • A Description Logic for Analogical Reasoning / Schockaert, S., Ibanez Garcia, Y. A., & Gutierrez-Basulto, V. (2021). A Description Logic for Analogical Reasoning. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI 2021, Montreal, Kanada, Non-EU. IJCAI. https://doi.org/10.24963/ijcai.2021/281
  • A Scalable Reasoning and Learning Approach for Neural-Symbolic Stream Fusion / Eiter, T., Le-Phuoc, D., & Le-Tuan, A. (2021). A Scalable Reasoning and Learning Approach for Neural-Symbolic Stream Fusion. In AAAI 2021 Proceedings (pp. 4996–5005). AAAI Press. http://hdl.handle.net/20.500.12708/55682
  • Dagstuhl Seminar on the Foundations of Composite Event Recognition / Eiter, T., Artikis, A., Margara, A., & Vansummeren, S. (2021). Dagstuhl Seminar on the Foundations of Composite Event Recognition. In ACM SIGMOD Record (pp. 24–27). ACM SIGMOND Record. https://doi.org/10.1145/3456859.3456865
  • On the Complexity of Sum-of-Products Problems over Semirings. / Eiter, T., & Kiesel, R. P. D. (2021). On the Complexity of Sum-of-Products Problems over Semirings. In Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Thirty-Third Conference on Innovative Applications of Artificial Intelligence, IAAI 2021, The Eleventh Symposium on Educational Advances in Artificial Intelligence, EAAI 2021, Virtual Event, February 2-9, 2021 (pp. 6304–6311). http://hdl.handle.net/20.500.12708/55669
  • Process Mining with Common Sense / Calvanese, D., Lukumbuzya, S., Montali, M., & Simkus, M. (2021). Process Mining with Common Sense. In Proceedings of the International Workshop on BPM Problems to Solve Before We Die (PROBLEMS 2021) (pp. 45–50). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55664
  • Determining Inference Semantics for Disjunctive Logic Programs (Extended Abstract) / Shen, Y.-D., & Eiter, T. (2021). Determining Inference Semantics for Disjunctive Logic Programs (Extended Abstract). In C. Bessiere (Ed.), Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI-20) (pp. 5040–5044). http://hdl.handle.net/20.500.12708/55568
    Project: IE of ASP (2015–2018)
  • Modelling Concept Interpolation in Description Logics using Abstract Betweenness Relations / Schockaert, S., Ibanez Garcia, Y. A., & Gutierrez-Basulto, V. (2021). Modelling Concept Interpolation in Description Logics using Abstract Betweenness Relations. In Proceedings of the 34th International Workshop on Description Logics (DL 2021). International Workshop on Description Logics (DL), Windermere, Lake District, UK, EU. CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/58767
  • CQELS 2.0: Towards A Unified Framework for Semantic Stream Fusion / Le-Tuan, A., Nguyen Duc, M., Chien-Quang, L., Tran, T.-K., Hauswirth, M., Eiter, T., & Le Phuoc, D. (2021). CQELS 2.0: Towards A Unified Framework for Semantic Stream Fusion. In 5th Stream Reasoning Workshop (SRW 2021). 5th Stream Reasoning Workshop (SRW 2021), Milan, Italy, EU. http://hdl.handle.net/20.500.12708/58752
  • Closed- and Open-world Reasoning in DL-Lite for Cloud Infrastructure Security (Extended Abstract) / Cauli, C., Ortiz de la Fuente, M. M., & Piterman, N. (2021). Closed- and Open-world Reasoning in DL-Lite for Cloud Infrastructure Security (Extended Abstract). In Proceedings of the 34th International Workshop on Description Logics (DL 2021). International Workshop on Description Logics, Wien, Austria. CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/58750
  • Closed- and Open-world Reasoning in DL-Lite for Cloud Infrastructure Security / Cauli, C., Ortiz, M., & Piterman, N. (2021). Closed- and Open-world Reasoning in DL-Lite for Cloud Infrastructure Security. In Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning. KR 2021 - 18th International Conference on Principles of Knowledge Representation and Reasoning, virtual event, International. https://doi.org/10.24963/kr.2021/17
  • Bounded Predicates in Description Logics with Counting / Lukumbuzya, S., & Simkus, M. (2021). Bounded Predicates in Description Logics with Counting. In Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence. IJCAI 2021 - 30th International Joint Conference on Artificial Intelligence, Montreal, Canada, International. International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2021/271
  • Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting / Eiter, T., Hecher, M., & Kiesel, R. (2021). Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting. In Proceedings of the Eighteenth International Conference on Principles of Knowledge Representation and Reasoning. KR 2021 - 18th International Conference on Principles of Knowledge Representation and Reasoning, virtual event, International. https://doi.org/10.24963/kr.2021/26
    Projects: HYPAR (2019–2024) / START (2014–2022)

2020

  • Preface: Special issue of the 25th RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion / Eiter, T., Maratea, M., & Vallati, M. (2020). Preface: Special issue of the 25th RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion. Fundamenta Informaticae, 174(3–4), i–iii. https://doi.org/10.3233/FI-2020-1939
  • Managing Caching Strategies for Stream Reasoning with Reinforcement Learning / Dodaro, C., Eiter, T., Ogris, P., & Schekotihin, K. (2020). Managing Caching Strategies for Stream Reasoning with Reinforcement Learning. Theory and Practice of Logic Programming, 20(5: 36th International Conference on Logic Programming Special issue I), 625–640. https://doi.org/10.1017/s147106842000037x
    Project: DynaCon (2017–2020)
  • Querying Rich Ontologies by Exploiting the Structure of Data / Bajraktari, L. (2020). Querying Rich Ontologies by Exploiting the Structure of Data. KI - Künstliche Intelligenz, 34(3), 395–398. https://doi.org/10.1007/s13218-020-00672-9
  • Österreichische AI Strategie aus Sicht der Wissenschaft / Moser, B., Dorffner, G., Eiter, T., Faber, W., Klambauer, G., Legenstein, R., Nessler, B., Polleres, A., & Woltran, S. (2020). Österreichische AI Strategie aus Sicht der Wissenschaft. OCG Journal, 01–02, 14–17. http://hdl.handle.net/20.500.12708/141528
  • Considering Constraint Monotonicity and Foundedness in Answer Set Programming / Shen, Y.-D., & Eiter, T. (2020). Considering  Constraint Monotonicity and Foundedness in Answer Set Programming. In Proceedings of the 4th Workshop on Trends and Applications of Answer Set Programming. 4th Workshop on Trends and Applications of Answer Set Programming (TAASP 2020), Klagenfurt, Austria. http://hdl.handle.net/20.500.12708/58255
  • Fast Out‐of‐Core Octree Generation for Massive Point Clouds / Schütz, M., Ohrhallinger, S., & Wimmer, M. (2020). Fast Out‐of‐Core Octree Generation for Massive Point Clouds. Computer Graphics Forum, 39(7), 155–167. https://doi.org/10.1111/cgf.14134
  • Resilient Logic Programs: Answer Set Programs Challenged by Ontologies / Ortiz de la Fuente, M. M., Simkus, M., & Lukumbuzya, S. (2020). Resilient Logic Programs: Answer Set Programs Challenged by Ontologies. In V. Conitzer & F. Sha (Eds.), Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2917–2924). AAAI-20 Technical Tracks. https://doi.org/10.1609/aaai.v34i03.5683
  • Optimizing the Placement of Applications in Autonomous Vehicles / Kain, T., Tompits, H., Müller, J.-S., Wesche, M., Martinez Flores, Y. A., & Decke, H. (2020). Optimizing the Placement of Applications in Autonomous Vehicles. In E-proceedings of the 30th European Safety and Reliability Conference and 15th Probabilistic Safety Assessment and Management Conference (p. 8). http://hdl.handle.net/20.500.12708/55587
  • Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles / Kain, T., Mundhenk, P., Müller, J.-S., Tompits, H., Wesche, M., & Decke, H. (2020). Towards a Reliable and Context-Based System Architecture for Autonomous Vehicles. In Proceedings of the 2nd International Workshop on Autonomous Systems Design (pp. 1–7). Schloss Dagstuhl--Leibniz-Zentrum für Informatik. https://doi.org/10.4230/OASIcs.ASD.2020.1
  • Fdiro: A General Approach for a Fail-Operational System Design / Kain, T., Tompits, H., Müller, J.-S., Mundhenk, P., Wesche, M., & Decke, H. (2020). Fdiro: A General Approach for a Fail-Operational System Design. In E-proceedings of the 30th European Safety and Reliability Conference and 15th Probabilistic Safety Assessment and Management Conference (ESREL2020 PSAM15) (p. 8). http://hdl.handle.net/20.500.12708/55586
  • Sequent-Type Calculi for Three-Valued and Disjunctive Default Logic / Pkhakadze, S., & Tompits, H. (2020). Sequent-Type Calculi for Three-Valued and Disjunctive Default Logic. Axioms, 9(3), 84. https://doi.org/10.3390/axioms9030084
  • Advancing Lazy-Grounding ASP Solving Techniques - Restarts, Phase Saving, Heuristics, and More / WEINZIERL, A., TAUPE, R., & FRIEDRICH, G. (2020). Advancing Lazy-Grounding ASP Solving Techniques - Restarts, Phase Saving, Heuristics, and More. Theory and Practice of Logic Programming, 20(5), 609–624. https://doi.org/10.1017/s1471068420000332
    Project: DynaCon (2017–2020)
  • Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints / TAUPE, R., WEINZIERL, A., & FRIEDRICH, G. (2020). Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints. Theory and Practice of Logic Programming, 20(5), 799–814. https://doi.org/10.1017/s1471068420000368
    Project: DynaCon (2017–2020)
  • Omission-based Abstraction for Answer Set Programs / SARIBATUR, Z. G., & EITER, T. (2020). Omission-based Abstraction for Answer Set Programs. Theory and Practice of Logic Programming, 21(2), 145–195. https://doi.org/10.1017/s1471068420000095
  • Fixed point semantics for stream reasoning / Antić, C. (2020). Fixed point semantics for stream reasoning. Artificial Intelligence, 288(103370), 103370. https://doi.org/10.1016/j.artint.2020.103370
  • Polynomial rewritings from expressive Description Logics with closed predicates to variants of Datalog / Ahmetaj, S., Ortiz, M., & Šimkus, M. (2020). Polynomial rewritings from expressive Description Logics with closed predicates to variants of Datalog. Artificial Intelligence, 280(103220), 103220. https://doi.org/10.1016/j.artint.2019.103220
    Projects: KtoAPP (2018–2025) / OMEGA (2017–2022)
  • ASP(AC): Answer Set Programming with Algebraic Constraints / Eiter, T., & Kiesel, R. (2020). ASP(AC): Answer Set Programming with Algebraic Constraints. Theory and Practice of Logic Programming, 20(6), 895–910. https://doi.org/10.1017/s1471068420000393
  • Advancing Lazy-Grounding ASP Solving Techniques - Restarts, Phase Saving, Heuristics, and More / Weinzierl, A., Taupe, R., & Friedrich, G. (2020). Advancing Lazy-Grounding ASP Solving Techniques - Restarts, Phase Saving, Heuristics, and More. arXiv. https://doi.org/10.48550/arXiv.2008.03526
    Project: DynaCon (2017–2020)
  • Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints / Taupe, R., Weinzierl, A., & Friedrich, G. (2020). Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints. arXiv. https://doi.org/10.48550/arXiv.2008.03100
    Project: DynaCon (2017–2020)
  • Answering Regular Path Queries Over SQ Ontologies / Gutierrez-Basulto, V., Ibanez Garcia, Y. A., & Jung, J. C. (2020). Answering Regular Path Queries Over SQ Ontologies. arXiv. http://hdl.handle.net/20.500.12708/141667
  • On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles / Gogacz, T., Gutierrez-Basulto, V., Ibanez Garcia, Y. A., Jung, J. C., & Murlak, F. (2020). On Finite and Unrestricted Query Entailment beyond SQ with Number Restrictions on Transitive Roles. arXiv. https://doi.org/10.48550/arXiv.2010.11503
  • Plausible Reasoning about EL-Ontologies using Concept Interpolation / Ibanez Garcia, Y. A., Gutierrez-Basulto, V., & Schockaert, S. (2020). Plausible Reasoning about EL-Ontologies using Concept Interpolation. arXiv. http://hdl.handle.net/20.500.12708/141664
  • Omission-based Abstraction for Answer Set Programs / Saribatur, Z. G., & Eiter, T. (2020). Omission-based Abstraction for Answer Set Programs. arXiv. https://doi.org/10.48550/arXiv.2004.01410
  • On Finite Entailment of Non-Local Queries in Description Logics / Gogacz, T., Gutierrez-Basulto, V., Gutowski, A., Ibanez Garcia, Y. A., & Murlak, F. (2020). On Finite Entailment of Non-Local Queries in Description Logics. arXiv. https://doi.org/10.48550/arXiv.2006.16869
  • ASP(AC): Answer Set Programming with Algebraic Constraints / Eiter, T., & Kiesel, R. P. D. (2020). ASP(AC): Answer Set Programming with Algebraic Constraints. 36th International Conference on Logic Programming (ICLP 2020), Rende, Italien, EU. http://hdl.handle.net/20.500.12708/87113
  • Abstraction for Zooming-In to Unsolvability Reasons of Grid-Cell Problems / Eiter, T., Saribatur, Z. G., & Schüller, P. (2020). Abstraction for Zooming-In to Unsolvability Reasons of Grid-Cell Problems. KR 2020 - 17th International Conference on Principles of Knowledge Representation and Reasoning, Rhodos, Griechenland, EU. http://hdl.handle.net/20.500.12708/87081
  • Catching the Ouroboros: On debugging non-ground answer-set programs / Oetsch, J., Pührer, J., & Tompits, H. (2020). Catching the Ouroboros: On debugging non-ground answer-set programs. 36th International Conference on Logic Programming (ICLP 2020), Rende, Italien, EU. http://hdl.handle.net/20.500.12708/87161
  • Ontology-Enriched Data Management with Partially Complete Data / Lukumbuzya, S. (2020). Ontology-Enriched Data Management with Partially Complete Data. 17th International Conference on Principles of Knowledge Representation and Reasoning, KR 2020, Rhodes, Greece, Non-EU. http://hdl.handle.net/20.500.12708/87121
  • Weighted LARS for Quantitative Stream Reasoning / Eiter, T., & Kiesel, R. P. D. (2020). Weighted LARS for Quantitative Stream Reasoning. Austrian Workshop on Logic in Computer Science, Turracher Höhe, Austria. http://hdl.handle.net/20.500.12708/87116
  • Quantitative and Stream Extensions of Answer Set Programming / Kiesel, R. P. D. (2020). Quantitative and Stream Extensions of Answer Set Programming. KR 2020 - 17th International Conference on Principles of Knowledge Representation and Reasoning, Rhodos, Griechenland, EU. http://hdl.handle.net/20.500.12708/87115
  • Quantities in Stream Reasoning / Eiter, T., & Kiesel, R. P. D. (2020). Quantities in Stream Reasoning. Reasoning about ACtions and Events over Streams (RACES), Rhodes, Greece, EU. http://hdl.handle.net/20.500.12708/87114
  • Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints / Taupe, R., Weinzierl, A., & Friedrich, G. (2020). Conflict Generalisation in ASP: Learning Correct and Effective Non-Ground Constraints. ICLP 2020, Rende, Italien, EU. http://hdl.handle.net/20.500.12708/87111
    Project: DynaCon (2017–2020)
  • Advancing Lazy-Grounding ASP Solving Techniques - Restarts, Phase Saving, Heuristics, and More / Weinzierl, A., Taupe, R., & Friedrich, G. (2020). Advancing Lazy-Grounding ASP Solving Techniques - Restarts, Phase Saving, Heuristics, and More. ICLP 2020, Rende, Italien, EU. http://hdl.handle.net/20.500.12708/87110
    Project: DynaCon (2017–2020)
  • A Hitchhiker's Tour Through Computational Complexity in Knowledge Representation and Reasoning / Eiter, T. (2020). A Hitchhiker’s Tour Through Computational Complexity in Knowledge Representation and Reasoning. KR 2020 - 17th International Conference on Principles of Knowledge Representation and Reasoning, Rhodos, Griechenland, EU. http://hdl.handle.net/20.500.12708/87087
  • SAT and Interactions (Dagstuhl Seminar 20061) / Beyersdorff, O., Egly, U., Mahajan, M., & Nalon, C. (Eds.). (2020). SAT and Interactions (Dagstuhl Seminar 20061). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. https://doi.org/10.4230/DagRep.10.2.1
  • Foundations of Composite Event Recognition (Dagstuhl Seminar 20071) / Artikis, A., Eiter, T., Margara, A., & Vansummeren, S. (Eds.). (2020). Foundations of Composite Event Recognition (Dagstuhl Seminar 20071). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. https://doi.org/10.4230/DagRep.10.2.19
  • Stable Model Semantics for Recursive SHACL / Andresel, M., Corman, J., Ortiz, M., Reutter, J. L., Savkovic, O., & Simkus, M. (2020). Stable Model Semantics for Recursive SHACL. In Proceedings of The Web Conference 2020. International World Wide Web Conference (WWW), UK, EU. ACM. https://doi.org/10.1145/3366423.3380229
  • Plausible Reasoning about EL-Ontologies using Concept Interpolation / Gutierrez-Basulto, V., Ibanez Garcia, Y. A., & Schockaert, S. (2020). Plausible Reasoning about EL-Ontologies using Concept Interpolation. In D. Calvanese, E. Erdem, & M. Thielscher (Eds.), Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning. AAAI Press. https://doi.org/10.24963/kr.2020/51
  • Sequent-Type Calculi for Systems of Nonmonotonic Paraconsistent Logics / Geibinger, T., & Tompits, H. (2020). Sequent-Type Calculi for Systems of Nonmonotonic Paraconsistent Logics. In Electronic Proceedings in Theoretical Computer Science (pp. 178–191). Electronic Proceedings in Theoretical Computer Science (EPTCS). https://doi.org/10.4204/eptcs.325.23
  • Weighted LARS for Quantitative Stream Reasoning / Eiter, T., & Kiesel, R. P. D. (2020). Weighted LARS for Quantitative Stream Reasoning. In 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain - Including 10th Conference on Prestigious Applications of Artificial Intelligence (PAIS 2020) (pp. 729–736). http://hdl.handle.net/20.500.12708/58341
  • MaxSAT-Based Postprocessing for Treedepth / Peruvemba Ramaswamy, V., & Szeider, S. (2020). MaxSAT-Based Postprocessing for Treedepth. In Lecture Notes in Computer Science (pp. 478–495). LNCS. https://doi.org/10.1007/978-3-030-58475-7_28
  • A Semantic Perspective on Omission Abstraction in ASP / Saribatur, Z. G., & Eiter, T. (2020). A Semantic Perspective on Omission Abstraction in ASP. In D. Calvanese & E. Erdem (Eds.), Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning. IJCAI Organization. https://doi.org/10.24963/kr.2020/75
  • ASP-Based Signal Plan Adjustments for Traffic Flow Optimization / Eiter, T., Falkner, A., Schneider, P., & Schüller, P. (2020). ASP-Based Signal Plan Adjustments for Traffic Flow Optimization. In ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020 - Including 10th Conference on Prestigious Applications of Artificial Intelligence (PAIS 2020) (p. 7). IOS Press - Frontiers in Artificial Intelligence and Applications. http://hdl.handle.net/20.500.12708/58244
    Project: DynaCon (2017–2020)
  • Pebble-Intervals Automata and FO$$^2$$ with Two Orders / Labai, N., Kotek, T., Ortiz, M., & Veith, H. (2020). Pebble-Intervals Automata and FO$$^2$$ with Two Orders. In Language and Automata Theory and Applications (pp. 208–221). Lecture Notes in Computer Science (LNCS). https://doi.org/10.1007/978-3-030-40608-0_14
  • Query Rewriting for Ontology-Mediated Conditional Answers / Andresel, M., Ortiz, M., & Simkus, M. (2020). Query Rewriting for Ontology-Mediated Conditional Answers. In V. Conitzer & F. Sha (Eds.), Proceedings of the AAAI Conference on Artificial Intelligence (pp. 2734–2741). AAAI-20 Technical Tracks. https://doi.org/10.1609/aaai.v34i03.5660
    Projects: KtoAPP (2018–2025) / OMEGA (2017–2022)
  • On Finite Entailment of Non-Local Queries in Description Logics / Gogacz, T., Gutierrez-Basulto, V., Gutowski, A., Ibanez Garcia, Y. A., & Murlak, F. (2020). On Finite Entailment of Non-Local Queries in Description Logics. In D. Calvanese, E. Erdem, & M. Thielscher (Eds.), Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning. AAAI Press. https://doi.org/10.24963/kr.2020/43
  • Rewritability Results for OMQs with Closed Predicates / Ortiz de la Fuente, M. M. (2020). Rewritability Results for OMQs with Closed Predicates. In Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020). Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), Rhodes, Greece, EU. CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55578
  • A Framework for Exploratory Query Answering with Ontologies / Andresel, M.-P., Ibanez Garcia, Y. A., & Ortiz de la Fuente, M. M. (2020). A Framework for Exploratory Query Answering with Ontologies. In Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020). Proceedings of the 33rd International Workshop on Description Logics (DL 2020) co-located with the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), Rhodes, Greece, EU. CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55577
  • An ExpTime Upper Bound for ALC with Integers / Labai, N., Simkus, M., & Ortiz de la Fuente, M. M. (2020). An ExpTime Upper Bound for ALC with Integers. In D. Calvanese, E. Erdem, & M. Thielscher (Eds.), Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning. AAAI Press. https://doi.org/10.24963/kr.2020/61
  • Datalog Rewritability and Data Complexity of ALCHOIF with Closed Predicates / Gogacz, T., Lukumbuzya, S., Simkus, M., & Ortiz de la Fuente, M. M. (2020). Datalog Rewritability and Data Complexity of ALCHOIF with Closed Predicates. In D. Calvanese, E. Erdem, & M. Thielscher (Eds.), Proceedings of the Seventeenth International Conference on Principles of Knowledge Representation and Reasoning. AAAI Press. https://doi.org/10.24963/kr.2020/44
  • An Adaptive Semantic Stream Reasoning Framework for Deep Neural Networks / Le-Phuoc, D., & Eiter, T. (2020). An Adaptive Semantic Stream Reasoning Framework for Deep Neural Networks. In Proceedings of the CIKM 2020 Workshops, co-located with 29th ACM International Conference on Information and Knowledge Management (CIKM 2020) Galway, Ireland, October 19-23, 2020 (pp. 1–5). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55570
  • Reasoning with Justifiable Exceptions in Contextual Hierarchies / Bozzato, L., Eiter, T., & Serafini, L. (2020). Reasoning with Justifiable Exceptions in Contextual Hierarchies. In G. De Giacomo (Ed.), ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020 - Including 10th Conference on Prestigious Applications of Artificial Intelligence (PAIS 2020) (pp. 2889–2890). IOS Press - Frontiers in Artificial Intelligence and Applications. http://hdl.handle.net/20.500.12708/55569
  • Towards Comprehensible ASP Reasoning by Means of Abstraction / Saribatur, Z. G. (2020). Towards Comprehensible ASP Reasoning by Means of Abstraction. In KR 2020 Workshop on Explainable Logic-Based Knowledge Representation (XLoKR) (pp. 1–6). http://hdl.handle.net/20.500.12708/55563
  • Abstraction for ASP Planning / Saribatur, Z. G. (2020). Abstraction for ASP Planning. In G. De Giacomo (Ed.), ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020 - Including 10th Conference on Prestigious Applications of Artificial Intelligence (PAIS 2020) (pp. 2933–2934). IOS Press - Frontiers in Artificial Intelligence and Applications. http://hdl.handle.net/20.500.12708/55562
  • A new OWLAPI interface for HEX-programs applied to explaining contingencies in production planning / Schüller, P. (2020). A new OWLAPI interface for HEX-programs applied to explaining contingencies in production planning. In A. Saffiotti, L. Serafini, & P. Lukowicz (Eds.), Proceedings of the First International Workshop on New Foundations for Human-Centered AI (NeHuAI) co-located with 24th European Conference on Artificial Intelligence (ECAI 2020), Santiago de Compostella, Spain, September 4, 2020 (p. 6). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55553
    Project: AI4EU (2019–2021)
  • Towards Lightweight Completion Formulas for Lazy Grounding in Answer Set Programming / Bogaerts, B., Marynissen, S., & Weinzierl, A. (2020). Towards Lightweight Completion Formulas for Lazy Grounding in Answer Set Programming. In M. V. Martinez & I. Varzinczak (Eds.), NMR 2020 Workshop Notes (p. 9). http://hdl.handle.net/20.500.12708/55542
    Project: DynaCon (2017–2020)
  • Ontology Focusing: Knowledge-Enriched Databases on Demand / Gogacz, T., Gutierrez-Basulto, V., Ibanez Garcia, Y. A., Murlak, F., Ortiz de la Fuente, M. M., & Simkus, M. (2020). Ontology Focusing: Knowledge-Enriched Databases on Demand. In ECAI 2020 - 24th European Conference on Artificial Intelligence (pp. 745–752). Frontiers in Artificial Intelligence and Applications. http://hdl.handle.net/20.500.12708/55576
  • An ExpTime Upper Bound for ALC with Integers (Extended Version) / Labai, N., Simkus, M., & Ortiz de la Fuente, M. M. (2020). An ExpTime Upper Bound for ALC with Integers (Extended Version) (2006.02078). http://hdl.handle.net/20.500.12708/40248

2019

2018

2017

  • PRuning Through Satisfaction / Heule, M. J. H., Kiesl, B., Seidl, M., & Biere, A. (2017). PRuning Through Satisfaction. In Hardware and Software: Verification and Testing (pp. 179–194). Lecture Notes in Computer Science / Springer. https://doi.org/10.1007/978-3-319-70389-3_12
  • Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood? / Kiesl, B., Seidl, M., Tompits, H., & Biere, A. (2017). Blockedness in Propositional Logic: Are You Satisfied With Your Neighborhood? In F. Bacchus (Ed.), Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. https://doi.org/10.24963/ijcai.2017/687
  • A Little Blocked Literal Goes a Long Way / Kiesl, B., Heule, M. J. H., & Seidl, M. (2017). A Little Blocked Literal Goes a Long Way. In S. Gaspers & T. Walsh (Eds.), Theory and Applications of Satisfiability Testing – SAT 2017 (pp. 281–297). Lecture Notes in Computer Science (LNCS) / Springer. https://doi.org/10.1007/978-3-319-66263-3_18
  • Managing Change in Graph-Structured Data Using Description Logics / Ahmetaj, S., Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2017). Managing Change in Graph-Structured Data Using Description Logics. ACM Transactions on Computational Logic, 18(4), 1–35. https://doi.org/10.1145/3143803
  • $$\mathsf {Harvey}$$ : A System for Random Testing in ASP / Greßler, A., Oetsch, J., & Tompits, H. (2017). $$\mathsf {Harvey}$$ : A System for Random Testing in ASP. In M. Balduccini & T. Janhunen (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 229–235). Lecture Notes in Computer Science, Springer LNCS. https://doi.org/10.1007/978-3-319-61660-5_21
  • Short Proofs Without New Variables / Heule, M. J. H., Kiesl, B., & Biere, A. (2017). Short Proofs Without New Variables. In L. de Moura (Ed.), Automated Deduction – CADE 26 (pp. 130–147). Springer. https://doi.org/10.1007/978-3-319-63046-5_9
  • Stream reasoning-based control of caching strategies in CCN routers / Beck, H., Bierbaumer, B., Dao-Tran, M., Eiter, T., Hellwagner, H., & Schekotihin, K. (2017). Stream reasoning-based control of caching strategies in CCN routers. In 2017 IEEE International Conference on Communications (ICC). IEEE Xplore Digital Library. https://doi.org/10.1109/icc.2017.7996762
  • Preference-Based Inconsistency Management in Multi-Context Systems / Eiter, T., & Weinzierl, A. (2017). Preference-Based Inconsistency Management in Multi-Context Systems. Journal of Artificial Intelligence Research, 60, 347–424. https://doi.org/10.1613/jair.5416
    Project: IE of ASP (2015–2018)
  • Conformant planning as a case study of incremental QBF solving / Egly, U., Kronegger, M., Lonsing, F., & Pfandler, A. (2017). Conformant planning as a case study of incremental QBF solving. Annals of Mathematics and Artificial Intelligence, 80(1), 21–45. http://hdl.handle.net/20.500.12708/147186
    Projects: FAIR (2013–2018) / START (2014–2022)
  • Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis / CUTERI, B., DODARO, C., RICCA, F., & SCHÜLLER, P. (2017). Constraints, lazy constraints, or propagators in ASP solving: An empirical analysis. Theory and Practice of Logic Programming, 17(5–6), 780–799. https://doi.org/10.1017/s1471068417000254
  • Integrating Answer Set Programming with Procedural Languages / Rath, J., & Redl, C. (2017). Integrating Answer Set Programming with Procedural Languages. In Y. Lierler & W. Taha (Eds.), Practical Aspects of Declarative Languages (pp. 50–67). Springer. https://doi.org/10.1007/978-3-319-51676-9_4
    Project: IE of ASP (2015–2018)
  • Extending Answer Set Programs with Interpreted Functions as First-class Citizens / Redl, C. (2017). Extending Answer Set Programs with Interpreted Functions as First-class Citizens. In Y. Lierler & W. Taha (Eds.), Practical Aspects of Declarative Languages (pp. 68–85). Springer. https://doi.org/10.1007/978-3-319-51676-9_5
    Project: IE of ASP (2015–2018)
  • ASP-based Inductive Logic Programming applied to Phrase Chunking: Challenges and Improvements / Schüller, P. (2017). ASP-based Inductive Logic Programming applied to Phrase Chunking: Challenges and Improvements. Language-Learning-Logic Workshop (3L 2017), London, EU. http://hdl.handle.net/20.500.12708/86558
  • Semi-supervised Case-based Reasoning Approach to Alarm Flood Analysis / Fullen, M., Schüller, P., & Niggemann, O. (2017). Semi-supervised Case-based Reasoning Approach to Alarm Flood Analysis. 3. Konferenz ML4CPS - Machine Learning for Cyber Physical Systems and Industry 4.0, Lemgo, Deutschland, EU. http://hdl.handle.net/20.500.12708/86557
  • Parallel QBF Solving: State of the Art Techniques and Future Perspectives / Lonsing, F. (2017). Parallel QBF Solving: State of the Art Techniques and Future Perspectives. First Workshop on Parallel Constraint Reasoning, Gothenburg, Sweden, EU. http://hdl.handle.net/20.500.12708/86674
    Project: Boolean (2011–2019)
  • Evaluating QBF Solvers: Quantifier Alternations Matter / Lonsing, F. (2017). Evaluating QBF Solvers: Quantifier Alternations Matter. Alpine Verification Meeting, IST Austria, Austria. http://hdl.handle.net/20.500.12708/86673
    Project: Boolean (2011–2019)
  • An Introduction to QBF Solving / Lonsing, F. (2017). An Introduction to QBF Solving. The Second Indian SAT+SMT School, Mysuru, India, Non-EU. http://hdl.handle.net/20.500.12708/86672
    Project: Boolean (2011–2019)
  • DLVHEX: A user-oriented integration of answer set programming with external sources / Redl, C. (2017). DLVHEX: A user-oriented integration of answer set programming with external sources. Second International Workshop on User-Oriented Logic Paradigms, Helsinki, Finland, EU. http://hdl.handle.net/20.500.12708/86520
  • Solving Advanced Argumentation Problems with Answer-Set Programming / Diller, M., Linsbichler, T., Woltran, S., Brewka, G., & Heissenberger, G. (2017). Solving Advanced Argumentation Problems with Answer-Set Programming. In Proceedings of the 31st AAAI Conference on Artificial Intelligence (pp. 1077–1083). http://hdl.handle.net/20.500.12708/55706
    Project: GRAPPA (2016–2019)
  • Explaining Inconsistency in Answer Set Programs and Extensions / Redl, C. (2017). Explaining Inconsistency in Answer Set Programs and Extensions. In Proceedings of the Fourteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2017) (pp. 176–190). http://hdl.handle.net/20.500.12708/55705
    Project: IE of ASP (2015–2018)
  • Event Detection and Diagnosis for Intelligent Transport Systems / Schneider, P. (2017). Event Detection and Diagnosis for Intelligent Transport Systems. In N. Bassiliades, A. Bikakis, S. Constantini, E. Franconi, A. Giurca, R. Kontchakov, T. Patkos, F. Sadri, & W. Van Woensel (Eds.), Nick Bassiliades, Antonis Bikakis, Stefania Costantini, Enrico Franconi, Adrian Giurca, Roman Kontchakov, Theodore Patkos, Fariba Sadri, William Van Woensel: Proceedings of the Doctoral Consortium, Challenge, Industry Track, Tutorials and Posters @ RuleML+RR 2017 hosted by International Joint Conference on Rules and Reasoning 2017 (RuleML+RR 2017). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55480
  • Streaming Multi-Context Systems / Eiter, T., & Dao-Tran, M. (2017). Streaming Multi-Context Systems. In C. Sierra (Ed.), Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. https://doi.org/10.24963/ijcai.2017/139
  • Constructive Satisfiability Procedure for ALCP(Z) (Preliminary Report) / Labai, N., Homola, M., & Ortiz de la Fuente, M. M. (2017). Constructive Satisfiability Procedure for ALCP(Z) (Preliminary Report). In A. Artale, B. Glimm, & R. Kontchakov (Eds.), Proceedings of the 30th International Workshop on Description Logics (pp. 1–13). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55478
  • Clopen Knowledge Bases: Combining Description Logics and Answer Set Programming / Bajraktari, L., Ortiz de la Fuente, M. M., & Simkus, M. (2017). Clopen Knowledge Bases: Combining Description Logics and Answer Set Programming. In A. Artale, B. Glimm, & R. Kontchakov (Eds.), Proceedings of the 30th International Workshop on Description Logics (pp. 1–13). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55477
  • Encoding monotonic multiset preferences using CI-nets / Diller, M., & Hunter, A. (2017). Encoding monotonic multiset preferences using CI-nets. In Datenbanksysteme für Business, Technologie und Web (BTW 2017), 17. Fachtagung des GI-Fachbereichs Datenbanken und Informationssysteme (DBIS), Workshopband (pp. 169–180). http://hdl.handle.net/20.500.12708/57303
  • Detecting Mobility Patterns using Spatial Query Answering over Streams / Eiter, T., Parreira, J., & Schneider, P. (2017). Detecting Mobility Patterns using Spatial Query Answering over Streams. In D. Dell´Aglio, D. Anicic, P. Barnaghi, E. Della Valle, D. McGuinness, L. Bozzato, T. Eiter, M. Homola, & D. Porello (Eds.), Joint Proceedings of the Web Stream Processing workshop (WSP 2017) and the 2nd International Workshop on Ontology Modularity, Contextuality, and Evolution (WOMoCoE 2017) co-located with 16th International Semantic Web Conference (ISWC 2017) (pp. 17–32). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/57301
  • Evaluating Epistemic Negation in Answer Set Programming (Extended Abstract) / Eiter, T., & Shen, Y.-D. (2017). Evaluating Epistemic Negation in Answer Set Programming (Extended Abstract). In C. Sierra (Ed.), Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. https://doi.org/10.24963/ijcai.2017/722
  • An Approach for Representing Answer Sets in Natural Language / Tompits, H., & Fang, M. (2017). An Approach for Representing Answer Sets in Natural Language. In D. Seipel, M. Hanus, & S. Abreu (Eds.), Declare 2017 - Conference on Declarative Programming (pp. 107–122). Technical Report, Institute of Computer Science, University of Würzburg. http://hdl.handle.net/20.500.12708/57281
  • Introducing Heuristics for Lazy-Grounding ASP Solving / Taupe, R., Weinzierl, A., & Schenner, G. (2017). Introducing Heuristics for Lazy-Grounding ASP Solving. In M. Gebser, M. Maratea, & F. Ricca (Eds.), 1st International Workshop on Practical Aspects of Answer Set Programming (PAoASP 2017) (p. 13). http://hdl.handle.net/20.500.12708/57263
    Project: IE of ASP (2015–2018)
  • Blending Lazy-Grounding and CDNL Search for Answer-Set Solving / Weinzierl, A. (2017). Blending Lazy-Grounding and CDNL Search for Answer-Set Solving. In M. Balduccini & T. Janhunen (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 191–204). Lecture Notes in Artificial Intelligence / Springer. https://doi.org/10.1007/978-3-319-61660-5_17
  • On Query Answering in Description Logics with Number Restrictions on Transitive Roles / Gutierrez-Basulto, V., Ibanez Garcia, Y. A., & Jung, J. C. (2017). On Query Answering in Description Logics with Number Restrictions on Transitive Roles. In Proceedings of the 30th International Workshop on Description Logics (pp. 1–13). http://hdl.handle.net/20.500.12708/57221
  • Techniques for Efficient Lazy-Grounding ASP Solving / Leutgeb, L., & Weinzierl, A. (2017). Techniques for Efficient Lazy-Grounding ASP Solving. In D. Seipel, M. Hanus, & S. Abreu (Eds.), Declare 2017 - Conference on Declarative Programming (p. 16). http://hdl.handle.net/20.500.12708/57220
    Project: IE of ASP (2015–2018)
  • Spatial Ontology-Mediated Query Answering over Mobility Streams / Eiter, T., Parreira, J. X., & Schneider, P. (2017). Spatial Ontology-Mediated Query Answering over Mobility Streams. In E. Blomqvist, D. Maynard, A. Gangemi, R. Hoekstra, P. Hitzler, & O. Hartig (Eds.), The Semantic Web (pp. 219–237). Springer Lecture Notes in Computer Science LNCS. https://doi.org/10.1007/978-3-319-58068-5_14
  • Expressive Stream Reasoning with Laser / Bazoobandi, H. R., Beck, H., & Urbani, J. (2017). Expressive Stream Reasoning with Laser. In Lecture Notes in Computer Science (pp. 87–103). Springer, LNCS. https://doi.org/10.1007/978-3-319-68288-4_6
  • Ticker: A system for incremental ASP-based stream reasoning / BECK, H., EITER, T., & FOLIE, C. (2017). Ticker: A system for incremental ASP-based stream reasoning. In Theory and Practice of Logic Programming (pp. 744–763). Cambridge University Press. https://doi.org/10.1017/s1471068417000370
  • Number Restrictions on Transitive Roles in Description Logics with Nominals / Ibanez Garcia, Y. A., Gutierrez-Basulto, V., & Jung, J. C. (2017). Number Restrictions on Transitive Roles in Description Logics with Nominals. In Proceedings of the 30th International Workshop on Description Logics. International Workshop on Description Logics (DL), Windermere, Lake District, UK, EU. CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/57175
  • The Potential of Interference-Based Proof Systems / Heule, M., & Kiesl, B. (2017). The Potential of Interference-Based Proof Systems. In EPiC Series in Computing. The First International ARCADE (Automated Reasoning: Challenges, Applications, Directions, Exemplary Achievements) Workshop, Gothenburg, Sweden, EU. EPiC Series in Computing / EasyChair. https://doi.org/10.29007/vr7n
  • DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL / Lonsing, F., & Egly, U. (2017). DepQBF 6.0: A Search-Based QBF Solver Beyond Traditional QCDCL. In Automated Deduction – CADE 26 (pp. 371–384). Springer. https://doi.org/10.1007/978-3-319-63046-5_23
    Project: Boolean (2011–2019)
  • Lazy-Grounding for Answer Set Programs with External Source Access / Eiter, T., Kaminski, T., & Weinzierl, A. (2017). Lazy-Grounding for Answer Set Programs with External Source Access. In C. Sierra (Ed.), Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence. ijcai.org. https://doi.org/10.24963/ijcai.2017/141
    Projects: CDCP (2008–2012) / IE of ASP (2015–2018)
  • A uniform framework for substructural logics with modalities / Lellmann, B. (2017). A uniform framework for substructural logics with modalities. In T. Eiter (Ed.), LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, 7-12th May 2017 (pp. 435–455). EasyChair EPiC Series in Computing. http://hdl.handle.net/20.500.12708/57108
  • Bunched Hypersequent Calculi for Distributive Substructural Logics / Ramanayake, R., & Ciabattoni, A. (2017). Bunched Hypersequent Calculi for Distributive Substructural Logics. In T. Eiter (Ed.), LNCS 7180, 21st International Proceedings of 21st Int. Conference on Logic for Programming, Artificial Intelligence and Reasoning (pp. 417–434). Springer LNCS. http://hdl.handle.net/20.500.12708/57070
  • Conflict-driven ASP Solving with External Sources and Program Splits / Redl, C. (2017). Conflict-driven ASP Solving with External Sources and Program Splits. In Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI 2017) (pp. 1239–1246). AAAI Press. http://hdl.handle.net/20.500.12708/56928
    Project: IE of ASP (2015–2018)
  • Answer Set Programs with Queries over Subprograms / Redl, C. (2017). Answer Set Programs with Queries over Subprograms. In Proceedings of the Fourteenth International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2017) (pp. 160–175). Springer. http://hdl.handle.net/20.500.12708/56904
    Project: IE of ASP (2015–2018)
  • Number Restrictions on Transitive Roles in Description Logics with Nominals / Gutierrez-Basulto, V., Ibanez Garcia, Y. A., & Jung, J. C. (2017). Number Restrictions on Transitive Roles in Description Logics with Nominals. In Proceeding of the 31st AAAI Conference on Artificial Intelligence (pp. 1121–1127). AAAI Press. http://hdl.handle.net/20.500.12708/56865
  • Answer Set Programs with External Source Access: Integrated Evaluation and New Applications / Kaminski, T. (2017). Answer Set Programs with External Source Access: Integrated Evaluation and New Applications. In M. De Vos (Ed.), LPNMR 2017 Doctoral Consortium (pp. 17–22). http://hdl.handle.net/20.500.12708/56687
    Project: IE of ASP (2015–2018)
  • On Equivalance and Inconsistency of Answer Set Programs with External Sources / Redl, C. (2017). On Equivalance and Inconsistency of Answer Set Programs with External Sources. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17) (pp. 1222–1228). http://hdl.handle.net/20.500.12708/56575
    Project: IE of ASP (2015–2018)
  • Efficient Evaluation of Answer Set Programs with External Sources Based on External Source Inlining / Redl, C. (2017). Efficient Evaluation of Answer Set Programs with External Sources Based on External Source Inlining. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17) (pp. 1229–1235). http://hdl.handle.net/20.500.12708/56574
    Project: IE of ASP (2015–2018)
  • Defeasible AceRules: A prototype / Diller, M., Wyner, A. Z., & Strass, H. (2017). Defeasible AceRules: A prototype. In Proceedings of the Twelfth International Conference on Computational Semantics (IWCS). Twelfth International Conference on Computational Semantics, Montpellier, Frankreich, EU. ACL anthology. http://hdl.handle.net/20.500.12708/57304
    Project: GRAPPA (2016–2019)
  • Evaluating QBF Solvers: Quantifier Alternations Matter / Lonsing, F., & Egly, U. (2017). Evaluating QBF Solvers: Quantifier Alternations Matter. http://hdl.handle.net/20.500.12708/39349
    Project: Boolean (2011–2019)
  • Stream Reasoning / Mileo, A., Dao-Tran, M., ​Eiter, T., & Fink, M. (2017). Stream Reasoning. In L. Liu & O. M. Tamer (Eds.), Encyclopedia of Database Systems (pp. 1–7). Springer Science+Business Media. https://doi.org/10.1007/978-1-4899-7993-3_80715-1
  • The Constraint Satisfaction Problem: Complexity and Approximability / Szeider, S., Ordyniak, S., & Gaspers, S. (2017). The Constraint Satisfaction Problem: Complexity and Approximability. In The Constraint Satisfaction Problem: Complexity and Approximability (pp. 137–157). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. http://hdl.handle.net/20.500.12708/29616
  • Joint Proceedings of the Web Stream Processing workshop (WSP 2017) and the 2nd International Workshop on Ontology Modularity, Contextuality, and Evolution (WOMoCoE 2017) co-located with 16th International Semantic Web Conference (ISWC 2017), Vienna, Austria, October 22nd, 2017 / Joint Proceedings of the Web Stream Processing workshop (WSP 2017) and the 2nd International Workshop on Ontology Modularity, Contextuality, and Evolution (WOMoCoE 2017) co-located with 16th International Semantic Web Conference (ISWC 2017), Vienna, Austria, October 22nd, 2017. (2017). In D. Dell´Aglio, D. Anicic, P. Barnaghi, E. Della Valle, D. McGuinness, L. Bozzato, T. Eiter, M. Homola, & D. Porello (Eds.), CEUR Workshop Proceedings. CEUR-WS.org. http://hdl.handle.net/20.500.12708/24394
  • Reasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering / Reasoning Web: Logical Foundation of Knowledge Graph Construction and Query Answering. (2017). In J. Z. Pan, D. Calvanese, T. Eiter, I. Horrocks, M. Kifer, F. Lin, & Y. Zhao (Eds.), Lecture Notes in Computer Science. Springer LNCS. https://doi.org/10.1007/978-3-319-49493-7
  • LPAR-21, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, May 7-12, 2017. EPiC Series in Computing 46 / Eiter, T., & Sands, D. (Eds.). (2017). LPAR-21, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana, May 7-12, 2017. EPiC Series in Computing 46. EasyChair EPiC Series in Computing. http://hdl.handle.net/20.500.12708/24393
  • IWIL@LPAR 2017 Workshop and LPAR-21 Short Presentations, Maun, Botswana, May 7-12, 2017. Kalpa Publications in Computing, Volume 1 / Eiter, T., Sands, D., Sutcliffe, G., & Voronkov, A. (Eds.). (2017). IWIL@LPAR 2017 Workshop and LPAR-21 Short Presentations, Maun, Botswana, May 7-12, 2017. Kalpa Publications in Computing, Volume 1. EasyChair. http://hdl.handle.net/20.500.12708/24392

2016

  • A model building framework for answer set programming with external computations / Eiter, T., Fink, M., Ianni, G., Krennwallner, T., Redl, C., & Schüller, P. (2016). A model building framework for answer set programming with external computations. Theory and Practice of Logic Programming, 16(4), 418–464. https://doi.org/10.1017/s1471068415000113
    Project: ASP (2012–2015)
  • Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) / Lonsing, F., & Seidl, M. (Eds.). (2016). Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016). CEUR-WS.org. http://hdl.handle.net/20.500.12708/24255
    Project: Boolean (2011–2019)
  • Dynamic Programming-based QBF Solving / Charwat, G., & Woltran, S. (2016). Dynamic Programming-based QBF Solving. In F. Lonsing & M. Seidl (Eds.), Proceedings of the 4th International Workshop on Quantified Boolean Formulas (QBF 2016) (p. 14). CEUR-WS.org. http://hdl.handle.net/20.500.12708/56683
    Projects: D-Flat (2013–2017) / START (2014–2022)
  • Q-Resolution with Generalized Axioms / Lonsing, F., Egly, U., & Seidl, M. (2016). Q-Resolution with Generalized Axioms. In Theory and Applications of Satisfiability Testing – SAT 2016 (pp. 435–452). Springer. https://doi.org/10.1007/978-3-319-40970-2_27
    Project: Boolean (2011–2019)
  • The QBF Gallery 2014: The QBF Competition at the FLoC Olympic Games / Janota, M., Jordan, C., Klieber, W., Lonsing, F., Seidl, M., & Van Gelder, A. (2016). The QBF Gallery 2014: The QBF Competition at the FLoC Olympic Games. Journal on Satisfiability, Boolean Modeling and Computation, 9, 187–206. http://hdl.handle.net/20.500.12708/149734
    Project: Boolean (2011–2019)
  • The QBF Gallery: Behind the Scenes / Lonsing, F., Seidl, M., & Van Gelder, A. (2016). The QBF Gallery: Behind the Scenes. Artificial Intelligence, 237, 92–114. https://doi.org/10.1016/j.artint.2016.04.002
    Project: Boolean (2011–2019)
  • Blocked clauses in first-order logic / Biere, A., Kiesl, B., Seidl, M., & Suda, M. (2016). Blocked clauses in first-order logic. The Third Vampire Workshop, VAMPIRE 2016, Coimbra, Portugal, EU. http://hdl.handle.net/20.500.12708/86389
  • Counting Answer Sets via Dynamic Programming / Fichte, J., Hecher, M., Morak, M., & Woltran, S. (2016). Counting Answer Sets via Dynamic Programming. In T. Eiter, W. Faber, & S. Woltran (Eds.), Proceedings of the Workshop on Trends and Applications of Answer Set Programming (TAASP 2016) (p. 14). http://hdl.handle.net/20.500.12708/56808
    Project: START (2014–2022)
  • Clique-Width and Directed Width Measures for Answer-Set Programming / Bliem, B., Ordyniak, S., & Woltran, S. (2016). Clique-Width and Directed Width Measures for Answer-Set Programming. In T. Eiter, W. Faber, & S. Woltran (Eds.), Proceedings of the Workshop on Trends and Applications of Answer Set Programming (TAASP 2016) (p. 17). http://hdl.handle.net/20.500.12708/56809
    Project: START (2014–2022)
  • The Impact of Active Domain Predicates on Guarded Existential Rules / Gottlob, G., Pieris, A., & Šimkus, M. (2016). The Impact of Active Domain Predicates on Guarded Existential Rules. In M. M. Ortiz de la Fuente & S. Schlobach (Eds.), Web Reasoning and Rule Systems (pp. 94–110). Lecture Notes in Computer Science / Springer. https://doi.org/10.1007/978-3-319-45276-0_8
    Projects: HINT (2012–2017) / START (2014–2022)
  • Verification of Evolving Graph-structured Data under Expressive Path Constraints / Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2016). Verification of Evolving Graph-structured Data under Expressive Path Constraints. In W. Martens & T. Zeume (Eds.), 19th International Conference on Database Theory, ICDT 2016, Bordeaux, France, March 15-18, 2016 (pp. 15:1-15:19). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. https://doi.org/10.4230/LIPIcs.ICDT.2016.15
    Projects: HINT (2012–2017) / SEE (2012–2016) / SemDat (2012–2016)
  • Semantically Enriched Multi-Modal Routing / Eiter, T., Krennwallner, T., Prandtstetter, M., Rudloff, C., Schneider, P., & Straub, M. (2016). Semantically Enriched Multi-Modal Routing. International Journal of Intelligent Transportation Systems Research, 14(1), 20–35. https://doi.org/10.1007/s13177-014-0098-8
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012) / MyITS (2011–2013)
  • Research Directions for Principles of Data Management (Abridged) / Abiteboul, S., Arenas, M., Barceló, P., Bienvenu, M., Calvanese, D., David, C., Hull, R., Hüllermeier, E., Kimelfeld, B., Libkin, L., Martens, W., Milo, T., Murlak, F., Neven, F., Ortiz, M., Schwentick, T., Stoyanovich, J., Su, J., Suciu, D., … Yi, K. (2016). Research Directions for Principles of Data Management (Abridged). ACM SIGMOD Record, 45(4), 5–17. https://doi.org/10.1145/3092931.3092933
  • Rule-based Stream Reasoning for Intelligent Administration of Content-Centric Networks / Beck, H., Bierbaumer, B., Dao-Tran, M., Eiter, T., Hellwagner, H., & Schekotihin, K. (2016). Rule-based Stream Reasoning for Intelligent Administration of Content-Centric Networks. In L. Michael & A. C. Kakas (Eds.), Logics in Artificial Intelligence (pp. 522–528). Springer. https://doi.org/10.1007/978-3-319-48758-8_34
  • Computing Repairs of Inconsistent DL-Programs over EL Ontologies / Eiter, T., Fink, M., & Stepanova, D. (2016). Computing Repairs of Inconsistent DL-Programs over EL Ontologies. Journal of Artificial Intelligence Research, 56, 463–515. http://hdl.handle.net/20.500.12708/149778
  • Data repair of inconsistent nonmonotonic description logic programs / Eiter, T., Fink, M., & Stepanova, D. (2016). Data repair of inconsistent nonmonotonic description logic programs. Artificial Intelligence, 239, 7–53. http://hdl.handle.net/20.500.12708/149773
  • Evaluating epistemic negation in answer set programming / Eiter, T., & Shen, Y.-D. (2016). Evaluating epistemic negation in answer set programming. Artificial Intelligence, 237, 115–135. http://hdl.handle.net/20.500.12708/149772
  • Semi-equilibrium models for paracoherent answer set programs / Amendola, G., Eiter, T., Fink, M., Leone, N., & Moura, J. (2016). Semi-equilibrium models for paracoherent answer set programs. Artificial Intelligence, 234, 219–271. http://hdl.handle.net/20.500.12708/149771
  • Conformant Planning as a Case Study of Incremental QBF Solving / Egly, U., Kronegger, M., Lonsing, F., & Pfandler, A. (2016). Conformant Planning as a Case Study of Incremental QBF Solving. Annals of Mathematics and Artificial Intelligence, 80(1), 21–45. https://doi.org/10.1007/s10472-016-9501-2
    Project: Boolean (2011–2019)
  • The DLVHEX System for Knowledge Representatin: Recent Advances (System Description) / REDL, C. (2016). The DLVHEX System for Knowledge Representatin: Recent Advances (System Description). Theory and Practice of Logic Programming, 16(5–6), 866–883. https://doi.org/10.1017/s1471068416000211
    Project: IE of ASP (2015–2018)
  • Domain Expansion for ASP-Programs with External Sources / Eiter, T., Fink, M., Krennwallner, T., & Redl, C. (2016). Domain Expansion for ASP-Programs with External Sources. Journal of Artificial Intelligence Research, 233, 84–121. http://hdl.handle.net/20.500.12708/148290
  • Obituary Peter Lucas / Eiter, T. (2016). Obituary Peter Lucas. Almanach, Österreichische Akademie Der Wissenschaften, 166, 330–333. http://hdl.handle.net/20.500.12708/150131
  • Obituary Helmut Veith (1971-2016) / Eiter, T. (2016). Obituary Helmut Veith (1971-2016). ACM SIGLOG News, 3(2), 3–5. http://hdl.handle.net/20.500.12708/150129
  • Answer Set Programming: An Introduction to the Special Issue / Brewka, G., Eiter, T., & Truszczynski, M. (2016). Answer Set Programming: An Introduction to the Special Issue. AI Magazine, 37(3), 5–6. http://hdl.handle.net/20.500.12708/149779
  • Angry-HEX: an Artificial Player for Angry Birds Based on Declarative Knowledge Bases / Ianni, G., Calimeri, F., Germano, S., Humenberger, A., Redl, C., Stepanova, D., Tucci, A., & Wimmer, A. (2016). Angry-HEX: an Artificial Player for Angry Birds Based on Declarative Knowledge Bases. IEEE Transactions on Computational Intelligence and AI in Games, 8(2), 128–139. https://doi.org/10.1109/tciaig.2015.2509600
    Projects: ASP (2012–2015) / IE of ASP (2015–2018)
  • A Query Model to Capture Event Pattern Matching in RDF Stream Processing Query Languages / Dell´Aglio, D., Dao-Tran, M., Calbimonte, J.-P., Le Phuoc, D., & Della Valle, E. (2016). A Query Model to Capture Event Pattern Matching in RDF Stream Processing Query Languages. In E. Blomqvist, P. Ciancarini, F. Poggi, & F. Vitali (Eds.), Knowledge Engineering and Knowledge Management (pp. 145–162). Springer. https://doi.org/10.1007/978-3-319-49004-5_10
  • A Benchmarking Framework for Stream Processors / Mossburger, A., Beck, H., Dao-Tran, M., & Eiter, T. (2016). A Benchmarking Framework for Stream Processors. 20th International Conference on Knowledge Engineering and Knowledge Management (EKAW), Bologna, EU. http://hdl.handle.net/20.500.12708/86413
  • First-Order Logic and Blocked Clauses / Kiesl, B., & Suda, M. (2016). First-Order Logic and Blocked Clauses. 4th International Workshop on Quantified Boolean Formulas (QBF 2016), Bordeaux, France, EU. http://hdl.handle.net/20.500.12708/86390
  • Knowledge-Based System Group, Vienna University of Technology / Eiter, T. (2016). Knowledge-Based System Group, Vienna University of Technology. Current AI Research in Austria (CAIRA) Workshop at the 39th German conference on Artificial Intelligence, Klagenfurt, Austria. http://hdl.handle.net/20.500.12708/86469
  • Managing Change in Graph-Structured Data Using Description Logics / Ortiz de la Fuente, M. M., & Simkus, M. (2016). Managing Change in Graph-Structured Data Using Description Logics. Workshop on New Trends in Belief Change, Vienna, Austria. http://hdl.handle.net/20.500.12708/86468
    Project: SemDat (2012–2016)
  • Some Thoughts on Stream Reasoning, Revision and Update / Eiter, T. (2016). Some Thoughts on Stream Reasoning, Revision and Update. Workshop on New Trends in Belief Change, Vienna, Austria. http://hdl.handle.net/20.500.12708/86467
  • Georg Gottlob: Life and Pictures / Eiter, T. (2016). Georg Gottlob: Life and Pictures. GG@60: Workshop on Databases and AI, Genova, Italy, EU. http://hdl.handle.net/20.500.12708/86466
  • Answer Set Programming and Extensions / Eiter, T. (2016). Answer Set Programming and Extensions. Summer School 2016: Verification Technology, Systems & Applications, Liege, Belgium, EU. http://hdl.handle.net/20.500.12708/86465
  • Query Answering with Description Logic Ontologies / Bienvenu, M., & Ortiz de la Fuente, M. M. (2016). Query Answering with Description Logic Ontologies. 28th European Summer School in Logic, Language and Information, Bolzano, Italy, EU. http://hdl.handle.net/20.500.12708/86464
    Project: SemDat (2012–2016)
  • Expressive Ontology and Query Languages for Data Access and Management / Ortiz de la Fuente, M. M. (2016). Expressive Ontology and Query Languages for Data Access and Management. 12th Reasoning Web Summer School (RW 2016), Aberdeen, Scotland, EU. http://hdl.handle.net/20.500.12708/86463
    Project: SemDat (2012–2016)
  • A Compilation Technique for Interactive Ontology-mediated Data Exploration / Andresel, M.-P. (2016). A Compilation Technique for Interactive Ontology-mediated Data Exploration. 12th Reasoning Web Summer School (RW 2016), Aberdeen, Scotland, EU. http://hdl.handle.net/20.500.12708/86462
    Project: SemDat (2012–2016)
  • Translations from QBFs to First-order Logic / Egly, U. (2016). Translations from QBFs to First-order Logic. Deduktionstreffen, Klagenfurt, Austria. http://hdl.handle.net/20.500.12708/86444
    Project: Boolean (2011–2019)
  • Submissions to QBFEVAL'16 / Lonsing, F. (2016). Submissions to QBFEVAL’16. 4th International Workshop on Quantified Boolean Formulas (QBF 2016), Bordeaux, France, EU. http://hdl.handle.net/20.500.12708/86434
    Project: Boolean (2011–2019)
  • An Overview of QBF Reasoning Techniques / Lonsing, F. (2016). An Overview of QBF Reasoning Techniques. Dagstuhl Seminar 16381: SAT and Interactions, Schloss Dagstuhl - Leibniz Zentrum für Informatik, EU. http://hdl.handle.net/20.500.12708/86432
    Project: Boolean (2011–2019)
  • Tutorial at IJCAI 2016: Solving (Problems with) Quantified Boolean Formulas: Recent Trends and Challenges / Lonsing, F. (2016). Tutorial at IJCAI 2016: Solving (Problems with) Quantified Boolean Formulas: Recent Trends and Challenges. Twenty-Fifth International Joint Conference on Artificial Intelligence - IJCAI 2016, New York, NY, USA, Non-EU. http://hdl.handle.net/20.500.12708/86433
    Project: Boolean (2011–2019)
  • Advances in QBF Reasoning / Lonsing, F. (2016). Advances in QBF Reasoning. SAT/SMT/AR Summer School 2016, Lissabon, Portugal, EU. http://hdl.handle.net/20.500.12708/86431
  • Towards Spatial Ontology-Mediated Query Answering over Mobility Streams / Eiter, T., Parreira, J., & Schneider, P. (2016). Towards Spatial Ontology-Mediated Query Answering over Mobility Streams. In D. Dell´Aglio, E. Della Valle, T. Eiter, & M. Krötzsch (Eds.), Joint Proceedings of the 3rd Stream Reasoning (SR 2016) and the 1st Semantic Web Technologies for the Internet of Things (SWIT 2016) workshops co-located with 15th International Semantic Web Conference (ISWC 2016) (pp. 13–24). CEUR. http://hdl.handle.net/20.500.12708/55453
  • Towards a Semantically Enriched Local Dynamic Map / Eiter, T., Füreder, H., Kasslatter, F., Parreira, J., & Schneider, P. (2016). Towards a Semantically Enriched Local Dynamic Map. In E. Chung & B. Smith (Eds.), 23rd World Congress on Intelligent Transport Systems 2016. IEEE. http://hdl.handle.net/20.500.12708/56863
  • On Stronger Calculi for QBFs / Egly, U. (2016). On Stronger Calculi for QBFs. In Theory and Applications of Satisfiability Testing – SAT 2016 (pp. 419–434). Springer. https://doi.org/10.1007/978-3-319-40970-2_26
    Project: Boolean (2011–2019)
  • Artificial Intelligence at the Gates of Dawn? / Eiter, T. (2016). Artificial Intelligence at the Gates of Dawn? In M. Pinzger (Ed.), 46. Jahrestag der Gesellschaft fuer Informatik (pp. 37–38). Lni / Gi. http://hdl.handle.net/20.500.12708/56835
  • Generalized Consistent Query Answering under Existential Rules / Eiter, T., Lukasiewicz, T., & Predoiu, L. (2016). Generalized Consistent Query Answering under Existential Rules. In J. P. Delgrande & F. Wolter (Eds.), Proceedings, Fifteenth International Conference on Principles of Knowledge Representation and Reasoning (KR 2016) (pp. 359–368). http://hdl.handle.net/20.500.12708/56833
  • HordeQBF: A Modular and Massively Parallel QBF Solver / Balyo, T., & Lonsing, F. (2016). HordeQBF: A Modular and Massively Parallel QBF Solver. In Theory and Applications of Satisfiability Testing – SAT 2016 (pp. 531–538). Springer. https://doi.org/10.1007/978-3-319-40970-2_33
    Project: Boolean (2011–2019)
  • Equivalent Stream Reasoning Programs / Beck, H., Dao-Tran, M., & Eiter, T. (2016). Equivalent Stream Reasoning Programs. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016 (pp. 929–935). IJCAI/AAAI Press. http://hdl.handle.net/20.500.12708/56817
  • Reactive Policies with Planning for Action Languages / Saribatur, Z. G., & Eiter, T. (2016). Reactive Policies with Planning for Action Languages. In G. Kern-Isberner & R. Wassermann (Eds.), Proceedings of the 16th International Workshop on Non-Monotonic Reasoning (pp. 143–152). http://hdl.handle.net/20.500.12708/56763
  • A Compilation Technique for Interactive Ontology-mediated Data Exploration / Andresel, M.-P., Ortiz de la Fuente, M. M., & Simkus, M. (2016). A Compilation Technique for Interactive Ontology-mediated Data Exploration. In M. Lenzerini & R. Penaloza (Eds.), Proceedings of the 29th International Workshop on Description Logics, Cape Town, South Africa, April 22-25, 2016. (p. 12). CEUR Workshop Proceedings / CEUR-WS.org. http://hdl.handle.net/20.500.12708/56678
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • Polynomial Disjunctive Datalog Rewritings of Instance Queries in Expressive Description Logics / Ahmetaj, S., Ortiz de la Fuente, M. M., & Simkus, M. (2016). Polynomial Disjunctive Datalog Rewritings of Instance Queries in Expressive Description Logics. In M. Lenzerini & R. Penaloza (Eds.), Proceedings of the 29th International Workshop on Description Logics, Cape Town, South Africa, April 22-25, 2016. (p. 13). CEUR Workshop Proceedings / CEUR-WS.org. http://hdl.handle.net/20.500.12708/56673
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • Closed Predicates in Description Logics: Results on Combined Complexity / Ngo, N., Ortiz de la Fuente, M. M., & Simkus, M. (2016). Closed Predicates in Description Logics: Results on Combined Complexity. In R. Pichler & A. S. da Silva (Eds.), Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016 (p. 5). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56672
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • Polynomial Datalog Rewritings for Ontology Mediated Queries with Closed Predicates / Ahmetaj, S., Ortiz de la Fuente, M. M., & Simkus, M. (2016). Polynomial Datalog Rewritings for Ontology Mediated Queries with Closed Predicates. In R. Pichler & A. S. da Silva (Eds.), Proceedings of the 10th Alberto Mendelzon International Workshop on Foundations of Data Management, Panama City, Panama, May 8-10, 2016 (p. 5). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/56671
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access / Eiter, T., Kaminski, T., Redl, C., & Weinzierl, A. (2016). Exploiting Partial Assignments for Efficient Evaluation of Answer Set Programs with External Source Access. In Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016 (pp. 1058–1065). IJCAI/AAAI Press. http://hdl.handle.net/20.500.12708/56579
    Project: IE of ASP (2015–2018)
  • Automated Benchmarking of KR-Systems / Redl, C. (2016). Automated Benchmarking of KR-Systems. In Proceedings of the 23rd RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion. 23rd RCRA International Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion, Genua, Italy, EU. http://hdl.handle.net/20.500.12708/56572
    Project: IE of ASP (2015–2018)
  • Problem Solving Using the HEX Family / Eiter, T., Redl, C., & Schüller, P. (2016). Problem Solving Using the HEX Family. In 60 Birthday: Gabriele Kern-Isberner, 2016 (pp. 150–174). College Publications. http://hdl.handle.net/20.500.12708/56573
    Project: IE of ASP (2015–2018)
  • Reactive Policy Checking for Action Languages / Saribatur, Z. G. (2016). Reactive Policy Checking for Action Languages. In S. Kambhampati (Ed.), Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (pp. 4024–4025). IJCAI/AAAI Press. http://hdl.handle.net/20.500.12708/56816
  • Closed Predicates in Description Logics: Results on Combined Complexity / Ngo, N., Ortiz de la Fuente, M. M., & Simkus, M. (2016). Closed Predicates in Description Logics: Results on Combined Complexity. In C. Baral, J. P. Delgrande, & F. Wolter (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Fifteenth International Conference, {KR} 2016, Cape Town, South Africa, April 25-29, 2016. (pp. 237–246). AAAI Press. http://hdl.handle.net/20.500.12708/56676
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates / Ahmetaj, S., Ortiz de la Fuente, M. M., & Simkus, M. (2016). Polynomial Datalog Rewritings for Expressive Description Logics with Closed Predicates. In S. Kambhampati (Ed.), Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI 2016, New York, NY, USA, 9-15 July 2016 (pp. 878–885). IJCAI/AAAI Press. http://hdl.handle.net/20.500.12708/56675
    Projects: HINT (2012–2017) / SemDat (2012–2016)
  • The ABC Benchmarking System User Manual / Redl, C. (2016). The ABC Benchmarking System User Manual (INFSYS RR-1843-16-01). http://hdl.handle.net/20.500.12708/38954
    Project: IE of ASP (2015–2018)
  • Joint Proceedings of the 3rd Stream Reasoning (SR 2016) and the 1st Semantic Web Technologies for the Internet of Things (SWIT 2016) workshops co-located with 15th International Semantic Web Conference (ISWC 2016) / Joint Proceedings of the 3rd Stream Reasoning (SR 2016) and the 1st Semantic Web Technologies for the Internet of Things (SWIT 2016) workshops co-located with 15th International Semantic Web Conference (ISWC 2016). (2016). In D. Dell´Aglio, E. Della Valle, T. Eiter, M. Krötzsch, M. Maleshkova, R. Verborgh, F. M. Facca, & M. Mrissa (Eds.), CEUR Workshop Proceedings. CEUR-WS.org. http://hdl.handle.net/20.500.12708/24275
  • Web Reasoning and Rule Systems / Web Reasoning and Rule Systems. (2016). In M. M. Ortiz de la Fuente & S. Schlobach (Eds.), Lecture Notes in Computer Science. Springer, LNCS. https://doi.org/10.1007/978-3-319-45276-0
    Project: SemDat (2012–2016)

2015

2014

2013

  • On Axiomatic Rejection for the Description Logic ALC / Berger, G., & Tompits, H. (2013). On Axiomatic Rejection for the Description Logic ALC. In M. Hanus & R. Rocha (Eds.), Kiel Declarative Programming Days 2013 (pp. 78–92). http://hdl.handle.net/20.500.12708/55038
  • Variable Dependencies and Q-Resolution / Slivovsky, F., & Szeider, S. (2013). Variable Dependencies and Q-Resolution. In F. Lonsing & M. Seidl (Eds.), International Workshop on Quantified Boolean Formulas 2013 Informal Workshop Report (pp. 22–29). http://hdl.handle.net/20.500.12708/54888
    Project: Complex Reason (2010–2014)
  • Reasoning about Explanations for Negative Query Answers in DL-Lite / Calvanese, D., Ortiz, M., Simkus, M., & Stefanoni, G. (2013). Reasoning about Explanations for Negative Query Answers in DL-Lite. Journal of Artificial Intelligence Research, 48, 635–669. https://doi.org/10.1613/jair.3870
    Projects: Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SemDat (2012–2016)
  • Kara: A System for Visualising and Visual Editing of Interpretations for Answer-Set Programs / Kloimüllner, C., Oetsch, J., Puehrer, J., & Tompits, H. (2013). Kara: A System for Visualising and Visual Editing of Interpretations for Answer-Set Programs. In Applications of Declarative Programming and Knowledge Management, 19th International Conference, INAP 2011 and 25th Workshop on Logic Programming, WLP 2011 Vienna, Austria, September 28-30, 2011 Revised Selected Papers (pp. 325–344). Springer, LNAI. http://hdl.handle.net/20.500.12708/54279
    Project: Methods (2009–2013)
  • Parameterized Complexity Results for Exact Bayesian Network Structure Learning / Ordyniak, S., & Szeider, S. (2013). Parameterized Complexity Results for Exact Bayesian Network Structure Learning. Journal of Artificial Intelligence Research, 46, 263–302. https://doi.org/10.1613/jair.3744
    Project: Complex Reason (2010–2014)
  • Parameterized Complexity and Kernel Bounds for Hard Planning Problems / Bäckström, C., Jonsson, P., Ordyniak, S., & Szeider, S. (2013). Parameterized Complexity and Kernel Bounds for Hard Planning Problems. In P. G. Spirakis & M. Serna (Eds.), Lecture Notes in Computer Science. Springer / LNCS. https://doi.org/10.1007/978-3-642-38233-8
    Project: Complex Reason (2010–2014)
  • Satisfiability of acyclic and almost acyclic CNF formulas / Ordyniak, S., Paulusma, D., & Szeider, S. (2013). Satisfiability of acyclic and almost acyclic CNF formulas. Theoretical Computer Science, 481, 85–99. https://doi.org/10.1016/j.tcs.2012.12.039
    Project: Complex Reason (2010–2014)
  • Upper and Lower Bounds for Weak Backdoor Set Detection / Misra, N., Ordyniak, S., Raman, V., & Szeider, S. (2013). Upper and Lower Bounds for Weak Backdoor Set Detection. In M. Järvisalo & A. Van Gelder (Eds.), Lecture Notes in Computer Science. Springer / LNCS. https://doi.org/10.1007/978-3-642-39071-5
    Project: Complex Reason (2010–2014)
  • Backdoors to q-Horn / Gaspers, S., Ordyniak, S., Ramanujan, M. S., Saurabh, S., & Szeider, S. (2013). Backdoors to q-Horn. In N. Portier & T. Wilke (Eds.), 30th Symposium on Theoretical Aspects of Computer Science (STACS´13) (pp. 67–79). Dagstuhl Publishing. http://hdl.handle.net/20.500.12708/54875
    Project: Complex Reason (2010–2014)
  • Eliminating Nonmonotonic DL-Atoms in Description Logic Programs / Wang, Y., You, J.-H., Yuan, L. Y., Shen, Y.-D., & Eiter, T. (2013). Eliminating Nonmonotonic DL-Atoms in Description Logic Programs. In D. Lembo & W. Faber (Eds.), Web Reasoning and Rule Systems (pp. 168–182). https://doi.org/10.1007/978-3-642-39666-3_13
    Project: Hybride Wissensbasen (2008–2012)
  • Global State Checker: Towards SAT-Based Reachability Analysis of Communicating State Machines / Kaufmann, P., Kronegger, M., Pfandler, A., Seidl, M., & Widl, M. (2013). Global State Checker: Towards SAT-Based Reachability Analysis of Communicating State Machines. In Proceedings of the 10th International Workshop on Model Driven Engineering, Verification and Validation co-located with 16th International Conference on Model Driven Engineering Languages and Systems (MODELS 2013) (pp. 31–40). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/54717
    Projects: Boolean (2011–2019) / FAIR (2013–2018) / FAME (2011–2014)
  • The Fourth Answer Set Programming Competition: Preliminary Report / Alviano, M., Calimeri, F., Charwat, G., Dao-Tran, M., Dodaro, C., Ianni, G., Krennwallner, T., Kronegger, M., Oetsch, J., Pfandler, A., Puehrer, J., Redl, C., Ricca, F., Schneider, P., Schwengerer, M., Spendier, L., Wallner, J. P., & Xiao, G. (2013). The Fourth Answer Set Programming Competition: Preliminary Report. In P. Cabalar & T. C. Son (Eds.), 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013) (pp. 42–53). Springer. http://hdl.handle.net/20.500.12708/54640
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012)
  • VCWC: A Versioning Competition Workflow Compiler / Charwat, G., Ianni, G., Krennwallner, T., Kronegger, M., Pfandler, A., Redl, C., Schwengerer, M., Spendier, L., Wallner, J. P., & Xiao, G. (2013). VCWC: A Versioning Competition Workflow Compiler. In T. C. Son & P. Cabalar (Eds.), 12th International Conference on Logic Programming and Nonmonotonic Reasoning (LPNMR 2013) (pp. 233–238). Springer. http://hdl.handle.net/20.500.12708/54641
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012)
  • Strong Backdoors to Bounded Treewidth SAT / Gaspers, S., & Szeider, S. (2013). Strong Backdoors to Bounded Treewidth SAT. In O. Reingold (Ed.), 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. IEEE. https://doi.org/10.1109/focs.2013.59
    Project: Complex Reason (2010–2014)
  • Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems / Dvořák, W., Gaggl, S. A., Wallner, J. P., & Woltran, S. (2013). Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems. In H. Tompits, S. Abreu, J. Oetsch, J. Puehrer, D. Seipel, M. Umeda, & A. Wolf (Eds.), Lecture Notes in Computer Science (pp. 114–133). Springer. https://doi.org/10.1007/978-3-642-41524-1_7
  • Guided Merging of Sequence Diagrams / Widl, M., Biere, A., Kaufmann, P., Egly, U., Heule, M., Kappel, G., Seidl, M., & Tompits, H. (2013). Guided Merging of Sequence Diagrams. In Software Language Engineering (pp. 164–183). Lecture Notes in Computer Science Volume 7745. https://doi.org/10.1007/978-3-642-36089-3_10
    Projects: Boolean (2011–2019) / FAME (2011–2014)
  • Complexity Classifications for logic-based Argumentation / Egly, U., Creignou, N., & Schmidt, J. (2013). Complexity Classifications for logic-based Argumentation. arXiv. https://doi.org/10.48550/arXiv.1304.5388
  • Marco Cadoli's Work on Nonmonotonic Reasoning / Eiter, T., & Gottlob, G. (2013). Marco Cadoli’s Work on Nonmonotonic Reasoning. Intelligenza Artificiale, 7(1), 7–17. http://hdl.handle.net/20.500.12708/155845
  • Finding Similar/Diverse Solutions in Answer Set Programming / EITER, T., ERDEM, E., ERDOGAN, H., & FINK, M. (2013). Finding Similar/Diverse Solutions in Answer Set Programming. Theory and Practice of Logic Programming, 13(3), 303–359. https://doi.org/10.1017/s1471068411000548
    Projects: HEX-Programme (2008–2012) / Hybride Wissensbasen (2008–2012)
  • Unification and Projectivity in De Morgan and Kleene Algebras / Bova, S., & Cabrer, L. (2013). Unification and Projectivity in De Morgan and Kleene Algebras. Order, 31(2), 159–187. https://doi.org/10.1007/s11083-013-9295-3
  • Generic Expression Hardness Results for Primitive Positive Formula Comparison / Bova, S., Chen, H., & Valeriote, M. (2013). Generic Expression Hardness Results for Primitive Positive Formula Comparison. Information and Computation, 222, 108–120. https://doi.org/10.1016/j.ic.2012.10.008
  • A Model-Theoretic Approach to Belief Change in Answer Set Programming / Delgrande, J., Schaub, T., Tompits, H., & Woltran, S. (2013). A Model-Theoretic Approach to Belief Change in Answer Set Programming. ACM Transactions on Computational Logic, 14(2), 1–46. https://doi.org/10.1145/2480759.2480766
    Project: Methods (2009–2013)
  • Model-Based Recasting in Answer-Set Programming / Eiter, T., Fink, M., Pührer, J., Tompits, H., & Woltran, S. (2013). Model-Based Recasting in Answer-Set Programming. Journal of Applied Non-Classical Logics, 23(1–2), 75–104. https://doi.org/10.1080/11663081.2013.799318
  • The Parameterized Complexity of Constraint Satisfaction and Reasoning / Szeider, S. (2013). The Parameterized Complexity of Constraint Satisfaction and Reasoning. In H. Tompits, S. Abreu, J. Oetsch, J. Pührer, D. Seipel, M. Umeda, & A. Wolf (Eds.), Applications of Declarative Programming and Knowledge Management (pp. 27–37). Springer / LNCS. https://doi.org/10.1007/978-3-642-41524-1_2
    Project: Complex Reason (2010–2014)
  • Revisiting Space in Proof Complexity: Treewidth and Pathwidth / Müller, M., & Szeider, S. (2013). Revisiting Space in Proof Complexity: Treewidth and Pathwidth. In K. Chatterjee & J. Sgall (Eds.), Mathematical Foundations of Computer Science 2013 (pp. 704–716). Springer / LNCS. https://doi.org/10.1007/978-3-642-40313-2_62
    Project: Complex Reason (2010–2014)
  • Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving / Egly, U., Lonsing, F., & Widl, M. (2013). Long-Distance Resolution: Proof Generation and Strategy Extraction in Search-Based QBF Solving. In K. McMillan, A. Middeldorp, & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (pp. 291–308). Springer. https://doi.org/10.1007/978-3-642-45221-5_21
    Projects: Boolean (2011–2019) / FAME (2011–2014)
  • Questions around quantified boolean formulas / Egly, U. (2013). Questions around quantified boolean formulas. ANR Boole Réunion Finale, Paris, Frankreich, EU. http://hdl.handle.net/20.500.12708/85685
  • Solving quantified Boolean formula / Egly, U. (2013). Solving quantified Boolean formula. Journées ANR BOOLE, Marseille, Frankreich, EU. http://hdl.handle.net/20.500.12708/85684
  • SAT Approach to Clique-Width / Szeider, S. (2013). SAT Approach to Clique-Width. Workshop on Graph Classes, Optimization, and Width Parameters (GROW), Santorini Island, Greece, EU. http://hdl.handle.net/20.500.12708/85669
    Project: Complex Reason (2010–2014)
  • Parameterized Complexity / Szeider, S. (2013). Parameterized Complexity. the International SAT/SMT Summer School, Espoo, Finland, EU. http://hdl.handle.net/20.500.12708/85668
    Project: Complex Reason (2010–2014)
  • Uniform Equivalence of Logic Programs under the Stable Model Semantics / Eiter, T., & Fink, M. (2013). Uniform Equivalence of Logic Programs under the Stable Model Semantics. 29th International Conference on Logic Programming (ICLP 2013), Istanbul, Non-EU. http://hdl.handle.net/20.500.12708/85759
  • Reasoning and Query Answering in Description Logics / Ortiz de la Fuente, M. M. (2013). Reasoning and Query Answering in Description Logics. School of the Alberto Mendelzon International Workshop on Foundations of Data Management, Puebla, Mexico, Non-EU. http://hdl.handle.net/20.500.12708/85758
  • Meta-Kernelization with Structural Parameters / Ganian, R. (2013). Meta-Kernelization with Structural Parameters. Contemporary Trends in Theoretical Computer Science (STTI 2013), Prague, Czech Republic, EU. http://hdl.handle.net/20.500.12708/85671
    Project: Complex Reason (2010–2014)
  • Meta-Kernelization with Structural Parameters / Ganian, R. (2013). Meta-Kernelization with Structural Parameters. Workshop on Graph Classes, Optimization, and Width Parameters (GROW), Santorini Island, Greece, EU. http://hdl.handle.net/20.500.12708/85670
    Project: Complex Reason (2010–2014)
  • AngryHEX: An Angry Birds-playing Agent based on HEX-Programs / Calimeri, F., Fink, M., Germano, S., Ianni, G., Redl, C., Stepanova, D., & Wimmer, A. (2013). AngryHEX: An Angry Birds-playing Agent based on HEX-Programs. AngryBirds Competition 2013, Beijing, China, Non-EU. http://hdl.handle.net/20.500.12708/85642
    Projects: ASP (2012–2015) / Hybride Wissensbasen (2008–2012)
  • Search-based QBF Solving: Basics, Recent Trends and Challenges / Lonsing, F. (2013). Search-based QBF Solving: Basics, Recent Trends and Challenges. JST ERATO Minato Discrete Strucure Manipulation System Project Seminar, Hokkaido University, Sapporo, Non-EU. http://hdl.handle.net/20.500.12708/85637
  • The QBF Gallery 2013 / Lonsing, F., & Seidl, M. (2013). The QBF Gallery 2013. International Workshop on Quantified Boolean Formulas, Helsinki, EU. http://hdl.handle.net/20.500.12708/85636
  • The QBF Gallery 2013 / Lonsing, F., & Seidl, M. (2013). The QBF Gallery 2013. 16th International Conference on Theory and Applications of Satisfiability Testing, Helsinki, EU. http://hdl.handle.net/20.500.12708/85635
  • Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes / Ganian, R., & Obdrálek, J. (2013). Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes. In T. Lecroq & L. Mouchard (Eds.), Combinatorial Algorithms - 24th International Workshop (pp. 164–177). Springer / LNCS. http://hdl.handle.net/20.500.12708/54878
    Project: Complex Reason (2010–2014)
  • FO Model Checking of Interval Graphs / Ganian, R., Hlinený, P., Král, D., Obdrálek, J., Schwartz, J., & Teska, J. (2013). FO Model Checking of Interval Graphs. In Automata, Languages, and Programming - 40th International Colloquium (pp. 250–262). Springer / LNCS. http://hdl.handle.net/20.500.12708/54877
    Project: Complex Reason (2010–2014)
  • Model Counting for Formulas of Bounded Clique-Width / Slivovsky, F., & Szeider, S. (2013). Model Counting for Formulas of Bounded Clique-Width. In L. Cai, S.-W. Cheng, & T.-W. Lam (Eds.), Algorithms and Computation (pp. 677–687). Springer / LNCS. https://doi.org/10.1007/978-3-642-45030-3_63
    Project: Complex Reason (2010–2014)
  • Model Counting for CNF Formulas of Bounded Modular Treewidth / Paulusma, D., Slivovsky, F., & Szeider, S. (2013). Model Counting for CNF Formulas of Bounded Modular Treewidth. In N. Portier & T. Wilke (Eds.), 30th Symposium on Theoretical Aspects of Computer Science (STACS´13) (pp. 55–66). Dagstuhl Publishing. http://hdl.handle.net/20.500.12708/54874
    Project: Complex Reason (2010–2014)
  • A SAT Approach to Clique-Width / Heule, M., & Szeider, S. (2013). A SAT Approach to Clique-Width. In M. Järvisalo & A. Van Gelder (Eds.), Lecture Notes in Computer Science. Springer / LNCS. https://doi.org/10.1007/978-3-642-39071-5
    Project: Complex Reason (2010–2014)
  • Local Backbones / de Haan, R., Kanj, I., & Szeider, S. (2013). Local Backbones. In M. Järvisalo & A. Van Gelder (Eds.), Lecture Notes in Computer Science. LNCS / Springer. https://doi.org/10.1007/978-3-642-39071-5
    Project: Complex Reason (2010–2014)
  • On the Subexponential Time Complexity of CSP / Kanj, I., & Szeider, S. (2013). On the Subexponential Time Complexity of CSP. In M. desJardins & M. Littman (Eds.), Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI´13) (pp. 459–465). AAAI Press. http://hdl.handle.net/20.500.12708/54867
    Project: Complex Reason (2010–2014)
  • Meta-kernelization with Structural Parameters / Ganian, R., Slivovsky, F., & Szeider, S. (2013). Meta-kernelization with Structural Parameters. In K. Chatterjee & J. Sgall (Eds.), Mathematical Foundations of Computer Science 2013 (pp. 457–468). Springer / LNCS. https://doi.org/10.1007/978-3-642-40313-2_41
    Project: Complex Reason (2010–2014)
  • Backdoors to Normality for Disjunctive Logic Programs / Fichte, J., & Szeider, S. (2013). Backdoors to Normality for Disjunctive Logic Programs. In M. desJardins & M. Littman (Eds.), Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI´13) (pp. 320–327). AAAI Press. http://hdl.handle.net/20.500.12708/54865
    Project: Complex Reason (2010–2014)
  • Parameterized Complexity Results for Plan Reuse / de Haan, R., Roubickova, A., & Szeider, S. (2013). Parameterized Complexity Results for Plan Reuse. In M. desJardins & M. Littman (Eds.), Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI´13) (pp. 224–231). AAAI Press. http://hdl.handle.net/20.500.12708/54863
    Project: Complex Reason (2010–2014)
  • Inconsistency Management for Description Logic Programs and Beyond / Eiter, T., Fink, M., & Stepanova, D. (2013). Inconsistency Management for Description Logic Programs and Beyond. In Web Reasoning and Rule Systems - 7th International Conference, RR 2013, Mannheim, Germany, July 27-29, 2013. Proceedings (pp. 1–3). http://hdl.handle.net/20.500.12708/54814
    Projects: ASP (2012–2015) / Hybride Wissensbasen (2008–2012)
  • Data Repair of Inconsistent DL-programs / Eiter, T., Fink, M., & Stepanova, D. (2013). Data Repair of Inconsistent DL-programs. In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (pp. 869–876). AAAI Press. http://hdl.handle.net/20.500.12708/54813
    Projects: ASP (2012–2015) / Hybride Wissensbasen (2008–2012)
  • Backdoors to Abduction / Pfandler, A., Rümmele, S., & Szeider, S. (2013). Backdoors to Abduction. In F. Rossi (Ed.), Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (pp. 1046–1052). AAAI Press. http://hdl.handle.net/20.500.12708/54790
    Projects: Complex Reason (2010–2014) / FAIR (2013–2018)
  • AngryHEX: An Artificial Player for Angry Birds Based on Declarative Knowledge Bases / Calimeri, F., Fink, M., Germano, S., Ianni, G., Redl, C., & Wimmer, A. (2013). AngryHEX: An Artificial Player for Angry Birds Based on Declarative Knowledge Bases. In M. Baldoni, F. Chesani, P. Mello, & M. Montali (Eds.), Proceedings of the Workshop Popularize Artificial Intelligence co-located with the 13th Conference of the Italian Association for Artificial Intelligence (AI*IA 2013), Turin, Italy, December 5, 2013 (pp. 29–35). http://hdl.handle.net/20.500.12708/54777
    Project: ASP (2012–2015)
  • ActHEX: Implementing HEX Programs with Action Atoms / Fink, M., Germano, S., Ianni, G., Redl, C., & Schüller, P. (2013). ActHEX: Implementing HEX Programs with Action Atoms. In P. Cabalar & T. C. Son (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 317–322). Springer. https://doi.org/10.1007/978-3-642-40564-8_31
    Project: ASP (2012–2015)
  • Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation / Lonsing, F., Egly, U., & Van Gelder, A. (2013). Efficient Clause Learning for Quantified Boolean Formulas via QBF Pseudo Unit Propagation. In Theory and Applications of Satisfiability Testing – SAT 2013 (pp. 100–115). https://doi.org/10.1007/978-3-642-39071-5_9
  • HEX-Programs with Nested Program Calls / Eiter, T., Krennwallner, T., & Redl, C. (2013). HEX-Programs with Nested Program Calls. In H. Tompits, S. Abreu, J. Oetsch, J. Puehrer, D. Seipel, M. Umeda, & A. Wolf (Eds.), Lecture Notes in Computer Science (pp. 269–278). Springer. https://doi.org/10.1007/978-3-642-41524-1_15
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012)
  • Grounding HEX-Programs with Expanding Domains / Eiter, T., Fink, M., Krennwallner, T., & Redl, C. (2013). Grounding HEX-Programs with Expanding Domains. In D. Pearce, S. Tasharrofi, E. Ternovska, & C. Vidal (Eds.), 2nd Workshop on Grounding and Transformations for Theories With Variables (GTTV’13) (p. 13). http://hdl.handle.net/20.500.12708/54766
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012)
  • Lightweight Spatial Conjunctive Query Answering Using Keywords / Eiter, T., Krennwallner, T., & Schneider, P. (2013). Lightweight Spatial Conjunctive Query Answering Using Keywords. In P. Cimiano, O. Corcho, V. Presutti, L. Hollink, & S. Rudolph (Eds.), The Semantic Web: Semantics and Big Data (pp. 243–258). Springer. https://doi.org/10.1007/978-3-642-38288-8_17
    Projects: ASP (2012–2015) / Hybride Wissensbasen (2008–2012) / MyITS (2011–2013) / Net2 (2010–2013)
  • Liberal Safety for Answer Set Programs with External Sources / Eiter, T., Fink, M., Krennwallner, T., & Redl, C. (2013). Liberal Safety for Answer Set Programs with External Sources. In M. desJardins & M. Littman (Eds.), Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI-13) (pp. 267–275). AAAI Press. http://hdl.handle.net/20.500.12708/54593
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012) / Hybride Wissensbasen (2008–2012)
  • Semantics-Aware Versioning Challenge: Merging Sequence Diagrams along with State Machine Diagrams / Kaufmann, P., Seidl, M., & Widl, M. (2013). Semantics-Aware Versioning Challenge: Merging Sequence Diagrams along with State Machine Diagrams. In Softwaretechnik-Trends (pp. 1–3). Gesellschaft für Informatik. http://hdl.handle.net/20.500.12708/54587
    Projects: Boolean (2011–2019) / FAME (2011–2014)
  • The SeaLion has Landed: An IDE for Answer-Set Programming-Preliminary Report / Oetsch, J., Puehrer, J., & Tompits, H. (2013). The SeaLion has Landed: An IDE for Answer-Set Programming-Preliminary Report. In Applications of Declarative Programming and Knowledge Management, 19th International Conference, INAP 2011, and 25th Workshop on Logic Programming, WLP 2011, Vienna, Austria, September 28-30, 2011, Revised Selected Papers (pp. 305–324). Springer, LNAI. http://hdl.handle.net/20.500.12708/54280
    Project: Methods (2009–2013)
  • Ontology Based Query Answering: The Story So Far / Ortiz de la Fuente, M. M. (2013). Ontology Based Query Answering: The Story So Far. In L. Bravo & M. Lenzerini (Eds.), Proceedings of the 7th Alberto Mendelzon International Workshop on Foundations of Data Management (pp. 1–14). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55143
    Project: SemDat (2012–2016)
  • Tractability Guarantees for DL-Lite Query Answering / Bienvenu, M., Ortiz de la Fuente, M. M., Simkus, M., & Xiao, G. (2013). Tractability Guarantees for DL-Lite Query Answering. In T. Eiter, B. Glimm, Y. Kazakov, & M. Krötzsch (Eds.), Informal Proceedings of the 26th International Workshop on Description Logics (pp. 41–52). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55142
    Projects: FAIR (2013–2018) / Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SEE (2012–2016) / SemDat (2012–2016)
  • Evolving Graph Databases under Description Logic Constraints / Calvanese, D., Ortiz de la Fuente, M. M., & Simkus, M. (2013). Evolving Graph Databases under Description Logic Constraints. In T. Eiter, B. Glimm, Y. Kazakov, & M. Krötzsch (Eds.), Informal Proceedings of the 26th International Workshop on Description Logics (pp. 120–131). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/55141
    Projects: Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SemDat (2012–2016)
  • Towards Query Answering in Relational Multi-Context Systems / Barilaro, R., Fink, M., Ricca, F., & Terracina, G. (2013). Towards Query Answering in Relational Multi-Context Systems. In P. Cabalar & T. C. Son (Eds.), Logic Programming and Nonmonotonic Reasoning, 12th International Conference, LPNMR 2013, Corunna, Spain, September 15-19, 2013. Proceedings (pp. 168–173). Springer. http://hdl.handle.net/20.500.12708/55064
  • Debugging Answer-Set Programs with Ouroboros - Extending the SeaLion Plugin / Frühstück, M., Puehrer, J., & Friedrich, G. (2013). Debugging Answer-Set Programs with Ouroboros - Extending the SeaLion Plugin. In Logic Programming and Nonmonotonic Reasoning, 12th International Conference, LPNMR 2013, Corunna, Spain, September 2013, Proceedings (pp. 323–328). Springer. http://hdl.handle.net/20.500.12708/55045
    Project: Methods (2009–2013)
  • SeaLion: An Eclipse-based IDE for Answer-Set Programming with Advanced Debugging Support / Busoniu, P.-A., Oetsch, J., Puehrer, J., Skocovsky, P., & Tompits, H. (2013). SeaLion: An Eclipse-based IDE for Answer-Set Programming with Advanced Debugging Support. In Theory and Practice of Logic Programming, Volume 13, Special Issue 4-5 (29th International Conference on Logic Programming) (pp. 657–673). Cambridge University Press. http://hdl.handle.net/20.500.12708/55044
    Project: Methods (2009–2013)
  • Conjunctive Regular Path Queries in Lightweight Description Logics / Bienvenu, M., Ortiz de la Fuente, M. M., & Simkus, M. (2013). Conjunctive Regular Path Queries in Lightweight Description Logics. In F. Rossi (Ed.), IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence (pp. 761–767). AAAI Press. http://hdl.handle.net/20.500.12708/55043
    Projects: FAIR (2013–2018) / Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SEE (2012–2016) / SemDat (2012–2016)
  • Tractable Queries for Lightweight Description Logics / Bienvenu, M., Ortiz de la Fuente, M. M., Simkus, M., & Xiao, G. (2013). Tractable Queries for Lightweight Description Logics. In F. Rossi (Ed.), IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence (pp. 768–774). AAAI Press. http://hdl.handle.net/20.500.12708/55042
    Projects: FAIR (2013–2018) / Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SEE (2012–2016) / SemDat (2012–2016)
  • Solution extraction from long-distance resolution proofs / Egly, U., & Widl, M. (2013). Solution extraction from long-distance resolution proofs. In M. Seidl & F. Lonsing (Eds.), International Workshop on Quantified Boolean Formulas 2013 Informal Workshop Report (p. 10). http://hdl.handle.net/20.500.12708/54894
    Projects: Boolean (2011–2019) / FAME (2011–2014)
  • Defeasibility in contextual reasoning with CKR / Bozzato, L., Eiter, T., & Serafini, L. (2013). Defeasibility in contextual reasoning with CKR. In Working Notes of the 5th International Workshop on Acquisition, Representation and Reasoning with Contextualized Knowledge (ARCOE-LogIC 2013) (p. 13). http://hdl.handle.net/20.500.12708/54892
    Project: ASP (2012–2015)
  • Hex Semantics via Approximation Fixpoint Theory / Antić, C., Eiter, T., & Fink, M. (2013). Hex Semantics via Approximation Fixpoint Theory. In P. Cabalar & T. C. Son (Eds.), Logic Programming and Nonmonotonic Reasoning (pp. 102–115). https://doi.org/10.1007/978-3-642-40564-8_11
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012)
  • Learning Non-Ground Rules for Answer-Set Solving / Weinzierl, A. (2013). Learning Non-Ground Rules for Answer-Set Solving. In D. Pearce, S. Tasharrofi, E. Ternovska, & C. Vidal (Eds.), 2nd Workshop on Grounding and Transformations for Theories With Variables (GTTV’13) (p. 13). http://hdl.handle.net/20.500.12708/54889
  • Capturing Structure in Hard Combinatorial Problems. / Szeider, S. (2013). Capturing Structure in Hard Combinatorial Problems. In Proceedings of the International Conference on Tools with Artificial Intelligence (ICTAI). The IEEE International Conference on Tools with Artificial Intelligence, Special Track on SAT and CSP Technologies (ICTAI), Washington D.C., USA, Non-EU. http://hdl.handle.net/20.500.12708/54879
    Project: Complex Reason (2010–2014)
  • Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem / Bliem, B., Pichler, R., & Woltran, S. (2013). Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem. In G. Gutin & S. Szeider (Eds.), Parameterized and Exact Computation (pp. 28–40). Springer. https://doi.org/10.1007/978-3-319-03898-8_4
    Project: D-Flat (2013–2017)
  • Model-Based Recasting in Answer-Set Programming / Eiter, T., Fink, M., Puehrer, J., Tompits, H., & Woltran, S. (2013). Model-Based Recasting in Answer-Set Programming (DBAI-TR-2013-83). http://hdl.handle.net/20.500.12708/37698
  • Proceedings of Answer Set Programming and Other Computing Paradigms (ASPOCP 2013), 6th International Workshop, August 25, 2013, Istanbul, Turkey / Fink, M., & Lierler, Y. (Eds.). (2013). Proceedings of Answer Set Programming and Other Computing Paradigms (ASPOCP 2013), 6th International Workshop, August 25, 2013, Istanbul, Turkey. Computing Research Repository (CoRR). http://hdl.handle.net/20.500.12708/23790
  • Applications of Declarative Programming and Knowledge Management, 19th International Conference, INAP 2011 and 25th Workshop on Logic Programming, WLP 2011 Vienna, Austria, September 28-30, 2011, Revised Selected Papers / Tompits, H., Abreu, S., Oetsch, J., Puehrer, J., Seipel, D., Umeda, M., & Wolf, A. (Eds.). (2013). Applications of Declarative Programming and Knowledge Management, 19th International Conference, INAP 2011 and 25th Workshop on Logic Programming, WLP 2011 Vienna, Austria, September 28-30, 2011, Revised Selected Papers. Springer, LNAI. http://hdl.handle.net/20.500.12708/23778
    Project: Methods (2009–2013)
  • Workshop Notes of the 5th International Workshop on Acquisition, Representation and Reasoning with Contextualized Knowledge ARCOE-13 September 15, 2013, La Corunna, Spain / Fink, M., Homola, M., Mileo, A., & Varzinczak, I. (Eds.). (2013). Workshop Notes of the 5th International Workshop on Acquisition, Representation and Reasoning with Contextualized Knowledge ARCOE-13 September 15, 2013, La Corunna, Spain. Online Publication. http://hdl.handle.net/20.500.12708/24964
  • Informal Proceedings of the 26th International Workshop on Description Logics / Informal Proceedings of the 26th International Workshop on Description Logics. (2013). In T. Eiter, B. Glimm, Y. Kazakov, & M. Krötzsch (Eds.), CEUR Workshop Proceedings. CEUR-WS.org. http://hdl.handle.net/20.500.12708/23749
  • MFCS & CSL 2010 Satellite Workshops: Selected Papers, Fundamenta Informaticae 123 / MFCS & CSL 2010 Satellite Workshops: Selected Papers, Fundamenta Informaticae 123. (2013). In A. Kucera, I. Potapov, A. Ciabattoni, S. Szeider, & R. Freivalds (Eds.), Fundamenta Informaticae. IOS Press. http://hdl.handle.net/20.500.12708/23747
    Project: Complex Reason (2010–2014)
  • Parameterized and Exact Computation, 8th International Symposium, IPEC 2013 (LNCS 8246) / Gutin, G., & Szeider, S. (Eds.). (2013). Parameterized and Exact Computation, 8th International Symposium, IPEC 2013 (LNCS 8246). Springer-Verlag. http://hdl.handle.net/20.500.12708/23746
    Project: Complex Reason (2010–2014)

2012

  • The Complexity of Explaining Negative Query Answers in DL-Lite / Calvanese, D., Ortiz de la Fuente, M. M., Simkus, M., & Stefanoni, G. (2012). The Complexity of Explaining Negative Query Answers in DL-Lite. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012 (pp. 583–587). AAAI Press. http://hdl.handle.net/20.500.12708/54355
    Projects: Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SemDat (2012–2016)
  • Strong Equivalence of Qualitative Optimization Problems / Faber, W., Truszczynski, M., & Woltran, S. (2012). Strong Equivalence of Qualitative Optimization Problems. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Proceedings of 13#^{th} int. conf. on Principles of Knowledge Representation and Reasoning (pp. 188–198). AAAI Press. http://hdl.handle.net/20.500.12708/54159
  • Mapping between RDF and XML with XSPARQL / Bischof, S., Decker, S., Krennwallner, T., & Polleres, A. (2012). Mapping between RDF and XML with XSPARQL. Journal on Data Semantics, 1(3), 147–185. https://doi.org/10.1007/s13740-012-0008-7
    Projects: HEX-Programme (2008–2012) / Hybride Wissensbasen (2008–2012) / Net2 (2010–2013)
  • Conjunctive query answering in the description logic SH using knots / Eiter, T., Ortiz, M., & Šimkus, M. (2012). Conjunctive query answering in the description logic SH using knots. Journal of Computer and System Sciences, 78(1), 47–85. https://doi.org/10.1016/j.jcss.2011.02.012
    Projects: Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SemDat (2012–2016)
  • Inconsistency Management for Traffic Regulations: Formalization and Complexity Results / Beck, H., Eiter, T., & Krennwallner, T. (2012). Inconsistency Management for Traffic Regulations: Formalization and Complexity Results. In L. F. del Cerro, A. Herzig, & J. Mengin (Eds.), Logics in Artificial Intelligence (pp. 80–93). Springer. https://doi.org/10.1007/978-3-642-33353-8_7
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012) / Hybride Wissensbasen (2008–2012) / MyITS (2011–2013)
  • Inconsistency Managment for Traffic Regulations / Beck, H., Eiter, T., & Krennwallner, T. (2012). Inconsistency Managment for Traffic Regulations. In B. Srivastava, F. Lecue, & A. Joshi (Eds.), The AAAI 2012 Workshop on Semantic Cities (p. 6). AAAI Press. http://hdl.handle.net/20.500.12708/54135
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012) / MyITS (2011–2013) / Net2 (2010–2013)
  • Semantically Enriched Multi-Modal Routing / Eiter, T., Krennwallner, T., Prandtstetter, M., Rudloff, C., Schneider, P., & Straub, M. (2012). Semantically Enriched Multi-Modal Routing. In V. Blervaque & R. Pfliegl (Eds.), 19th ITS World Congress (ITS World 2012) (p. 10). ERTICO-ITS Europe. http://hdl.handle.net/20.500.12708/54222
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012) / Hybride Wissensbasen (2008–2012) / MyITS (2011–2013) / Net2 (2010–2013)
  • Test Case Generation by Grammar-based Fuzzing for Model-driven Engineering / Widl, M. (2012). Test Case Generation by Grammar-based Fuzzing for Model-driven Engineering. In A. Biere, A. Nahir, & T. Vos (Eds.), Proceedings of the Eighth Haifa Verification Conference (p. 2). http://hdl.handle.net/20.500.12708/54407
    Projects: Boolean (2011–2019) / FAME (2011–2014)
  • qbf2epr: A Tool for Generating EPR Formulas from QBF / Seidl, M., Lonsing, F., & Biere, A. (2012). qbf2epr: A Tool for Generating EPR Formulas from QBF. In P. Fontaine, R. Schmidt, & S. Schulz (Eds.), Proceedings of PAAR 2012 (p. 8). http://hdl.handle.net/20.500.12708/54418
    Project: FAME (2011–2014)
  • Resolution-Based Certificate Extraction for QBF / Niemetz, A., Preiner, M., Lonsing, F., Seidl, M., & Biere, A. (2012). Resolution-Based Certificate Extraction for QBF. In A. Cimatti & R. Sebastiani (Eds.), Theory and Applications of Satisfiability Testing -- SAT 2012 (pp. 430–435). Springer LNCS. https://doi.org/10.1007/978-3-642-31612-8_33
    Project: FAME (2011–2014)
  • Guided Merging of Sequence Diagrams / Widl, M., Biere, A., Kaufmann, P., Egly, U., Heule, M., Kappel, G., Seidl, M., & Tompits, H. (2012). Guided Merging of Sequence Diagrams. In K. Czarnecki & G. Hedin (Eds.), SLE 2012 - Pre-proceedings (pp. 163–182). http://hdl.handle.net/20.500.12708/54255
    Projects: Boolean (2011–2019) / FAME (2011–2014)
  • Forgetting for Defeasible Logic / Antoniou, G., Eiter, T., & Wang, K. (2012). Forgetting for Defeasible Logic. In N. Bjørner & A. Voronkov (Eds.), Logic for Programming, Artificial Intelligence, and Reasoning (pp. 77–91). LNCS, Springer. https://doi.org/10.1007/978-3-642-28717-6_9
  • Conflict-driven ASP Solving with External Sources / Eiter, T., Fink, M., Krennwallner, T., & Redl, C. (2012). Conflict-driven ASP Solving with External Sources. arXiv. http://hdl.handle.net/20.500.12708/176427
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012) / Hybride Wissensbasen (2008–2012) / IncMan (2009–2012)
  • Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough / Pichler, R., Rümmele, S., Szeider, S., & Woltran, S. (2012). Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough. CoRR - Computing Research Repository. http://hdl.handle.net/20.500.12708/163667
    Project: TTPC (2008–2012)
  • Detection of Windows in Facades Using Image Processing Algorithms / Miljanovic, M., Egly, U., & Eiter, T. (2012). Detection of Windows in Facades Using Image Processing Algorithms. Indian Journal of Computer Science and Engineering, 3(4), 539–547. http://hdl.handle.net/20.500.12708/164414
  • Event-Sequence Testing using Answer-Set Programming / Brain, M., Erdem, E., Inoue, K., Oetsch, J., Puehrer, J., Tompits, H., & Yilmaz, C. (2012). Event-Sequence Testing using Answer-Set Programming. International Journal On Advances in Software, 5(3 & amp; 4), 15. http://hdl.handle.net/20.500.12708/164382
    Project: Methods (2009–2013)
  • A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set / Gaspers, S., & Liedloff, M. (2012). A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. Discrete Mathematics & Theoretical Computer Science, 78–89. https://doi.org/10.1007/11917496_8
    Project: Complex Reason (2010–2014)
  • On Independent Sets and Bicliques in Graphs / Gaspers, S., Kratsch, D., & Liedloff, M. (2012). On Independent Sets and Bicliques in Graphs. Algorithmica, 62(3–4), 637–658. https://doi.org/10.1007/s00453-010-9474-1
    Project: Complex Reason (2010–2014)
  • A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between / Gaspers, S., & Sorkin, G. B. (2012). A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. Journal of Computer and System Sciences, 78(1), 305–335. https://doi.org/10.1016/j.jcss.2011.05.010
    Project: Complex Reason (2010–2014)
  • Parameterizing by the Number of Numbers / Fellows, M. R., Gaspers, S., & Rosamond, F. A. (2012). Parameterizing by the Number of Numbers. Theory of Computing Systems, 50(4), 675–693. https://doi.org/10.1007/s00224-011-9367-y
    Project: Complex Reason (2010–2014)
  • Editing Graphs to Satisfy Degree Constraints: A Parameterized Approach / Mathieson, L., & Szeider, S. (2012). Editing Graphs to Satisfy Degree Constraints: A Parameterized Approach. Journal of Computer and System Sciences, 78(1), 179–191. https://doi.org/10.1016/j.jcss.2011.02.001
  • On Graph Contractions and Induced Minors / van ’t Hof, P., Kamiński, M., Paulusma, D., Szeider, S., & Thilikos, D. M. (2012). On Graph Contractions and Induced Minors. Discrete Applied Mathematics, 160(6), 799–809. https://doi.org/10.1016/j.dam.2010.05.005
    Project: Complex Reason (2010–2014)
  • Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming / Gutin, G., Kim, E. J., Soleimanfallah, A., Szeider, S., & Yeo, A. (2012). Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. Algorithmica, 64(1), 112–125. https://doi.org/10.1007/s00453-011-9548-8
    Project: Complex Reason (2010–2014)
  • Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough / PICHLER, R., RÜMMELE, S., SZEIDER, S., & WOLTRAN, S. (2012). Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough. Theory and Practice of Logic Programming, 14(2), 141–164. https://doi.org/10.1017/s1471068412000099
    Project: Complex Reason (2010–2014)
  • The Answer Set Programming Competition / Calimeri, F., Ianni, G., Krennwallner, T., & Ricca, F. (2012). The Answer Set Programming Competition. AI Magazine, 33(4), 114–118. http://hdl.handle.net/20.500.12708/163871
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012) / Hybride Wissensbasen (2008–2012)
  • Conflict-driven ASP solving with external sources / EITER, T., FINK, M., KRENNWALLNER, T., & REDL, C. (2012). Conflict-driven ASP solving with external sources. Theory and Practice of Logic Programming, 12(4–5), 659–679. https://doi.org/10.1017/s1471068412000233
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012) / Hybride Wissensbasen (2008–2012) / IncMan (2009–2012)
  • Augmenting Tractable Fragments of Abstract Argumentation / Dvořák, W., Ordyniak, S., & Szeider, S. (2012). Augmenting Tractable Fragments of Abstract Argumentation. Artificial Intelligence, 186, 157–173. https://doi.org/10.1016/j.artint.2012.03.002
    Projects: Argu (2009–2012) / Complex Reason (2010–2014)
  • Parameterized Complexity / Szeider, S. (2012). Parameterized Complexity. The Logic and Interactions Winter School, CIRM, Marseille, France, EU. http://hdl.handle.net/20.500.12708/85423
    Project: Complex Reason (2010–2014)
  • The Parameterized Complexity of Propositional Satisfiability / Szeider, S. (2012). The Parameterized Complexity of Propositional Satisfiability. Statistical Mechanics of Unsatisfiability and Glasses, Ferry Stockholm-Mariehamn and Hotel Arkipelag, Mariehamn, Åland, EU. http://hdl.handle.net/20.500.12708/85422
    Project: Complex Reason (2010–2014)
  • Parameterized Complexity Results for Probabilistic Network Structure Learning / Szeider, S. (2012). Parameterized Complexity Results for Probabilistic Network Structure Learning. Workshop on Applications of Parameterized Algorithms and Complexit, Warwick, UK, EU. http://hdl.handle.net/20.500.12708/85421
    Project: Complex Reason (2010–2014)
  • On sequent systems and resolution for quantified boolean formulas / Egly, U. (2012). On sequent systems and resolution for quantified boolean formulas. Dagstuhl Seminar 12471 - SAT Interactions, Dagstuhl, Deutschland, EU. http://hdl.handle.net/20.500.12708/85469
    Project: Boolean (2011–2019)
  • A new learning scheme for QDPLL solvers / Egly, U. (2012). A new learning scheme for QDPLL solvers. Dagstuhl Seminar 12461: Games and Decisions for Rigorous Systems Engineering, Dagstuhl, Deutschland, EU. http://hdl.handle.net/20.500.12708/85468
    Project: Boolean (2011–2019)
  • dynPARTIX 2.0 - Dynamic Programming Argumentation Reasoning Tool / Charwat, G., & Dvorak, W. (2012). dynPARTIX 2.0 - Dynamic Programming Argumentation Reasoning Tool. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Proceedings of Computational Models of Argument - Proceedings of COMMA 2012 (pp. 507–508). Frontiers in Artificial Intelligence and Applications / IOS Press. http://hdl.handle.net/20.500.12708/54497
    Project: Argu (2009–2012)
  • Comparing the Expressiveness of Argumentation Semantics / Dvorak, W., & Spanring, C. (2012). Comparing the Expressiveness of Argumentation Semantics. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Proceedings of Computational Models of Argument - Proceedings of COMMA 2012 (pp. 261–272). Frontiers in Artificial Intelligence and Applications / IOS Press. http://hdl.handle.net/20.500.12708/54496
    Project: Argu (2009–2012)
  • Complexity of logic-based argumentation in Schaefer's framework / Egly, U., Creignou, N., & Schmidt, J. (2012). Complexity of logic-based argumentation in Schaefer’s framework. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Computational Models of Argument (pp. 237–248). IOS Press. http://hdl.handle.net/20.500.12708/54461
    Project: Boolean (2011–2019)
  • On Sequent Systems and Resolution for QBFs / Egly, U. (2012). On Sequent Systems and Resolution for QBFs. In Theory and Applications of Satisfiability Testing – SAT 2012 (pp. 100–113). Lecture Notes in Computer Science, Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-31612-8_9
    Project: Boolean (2011–2019)
  • Linked Stream Data Processing Engines: Facts and Figures / Le-Phuoc, D., Dao-Tran, M., Pham, M.-D., Boncz, P., Eiter, T., & Fink, M. (2012). Linked Stream Data Processing Engines: Facts and Figures. In P. Cudre-Mauroux (Ed.), The Semantic Web – ISWC 2012 (pp. 300–312). Springer. https://doi.org/10.1007/978-3-642-35173-0_20
    Project: HEX-Programme (2008–2012)
  • Paraconsistent Hybrid Theories / Fink, M. (2012). Paraconsistent Hybrid Theories. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012, Rome, Italy, June 10-14, 2012 (pp. 391–401). AAAI Press. http://hdl.handle.net/20.500.12708/54439
    Projects: Hybride Wissensbasen (2008–2012) / IncMan (2009–2012)
  • Worst-Case Optimal Reasoning with Forest Logic Programs / Feier, C. (2012). Worst-Case Optimal Reasoning with Forest Logic Programs. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), 13th International Conference on Principles of Knowledge Representation and Reasoning (pp. 608–612). AAAI Press. http://hdl.handle.net/20.500.12708/54421
    Project: Hybride Wissensbasen (2008–2012)
  • Comparing Inconsistency Resolutions in Multi-Context Systems / Weinzierl, A. (2012). Comparing Inconsistency Resolutions in Multi-Context Systems. In D. Lassiter & M. Slavkovik (Eds.), Lecture Notes in Computer Science (pp. 158–174). Springer, LNCS. https://doi.org/10.1007/978-3-642-31467-4_11
    Project: IncMan (2009–2012)
  • OMiGA : An Open Minded Grounding On-The-Fly Answer Set Solver / Dao-Tran, M., Eiter, T., Fink, M., Weidinger, G., & Weinzierl, A. (2012). OMiGA : An Open Minded Grounding On-The-Fly Answer Set Solver. In L. F. del Cerro, A. Herzig, & J. Mengin (Eds.), Logics in Artificial Intelligence (pp. 480–483). Springer. https://doi.org/10.1007/978-3-642-33353-8_38
    Projects: HEX-Programme (2008–2012) / IncMan (2009–2012)
  • The DReW System for Nonmonotonic DL-Programs / Xiao, G., Eiter, T., & Heymans, S. (2012). The DReW System for Nonmonotonic DL-Programs. In J. Li (Ed.), Proceedings of Joint Conference of the Sixth Chinese Semantic Web Symposium and the First Chinese Web Science Conference. Sprlinger. http://hdl.handle.net/20.500.12708/54368
    Project: Hybride Wissensbasen (2008–2012)
  • Semantic Independence in DL-programs / Eiter, T., Fink, M., & Stepanova, D. (2012). Semantic Independence in DL-programs. In M. Krötzsch & U. Straccia (Eds.), Web Reasoning and Rule Systems - 6th International Conference, RR 2012, Vienna, Austria, September 10-12, 2012. Proceedings (pp. 58–74). Springer. http://hdl.handle.net/20.500.12708/54366
    Project: Hybride Wissensbasen (2008–2012)
  • Answering Expressive Path Queries over Lightweight DL Knowledge Bases / Bienvenu, M., Ortiz de la Fuente, M. M., & Simkus, M. (2012). Answering Expressive Path Queries over Lightweight DL Knowledge Bases. In Y. Kazakov, D. Lembo, & F. Wolter (Eds.), Proc. of the 2012 International Workshop on Description Logics (DL 2012) (pp. 81–91). http://hdl.handle.net/20.500.12708/54354
    Projects: Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SemDat (2012–2016)
  • Backdoors to Normality for Disjunctive Logic Programs / Fichte, J., & Szeider, S. (2012). Backdoors to Normality for Disjunctive Logic Programs. In Y. Lierler & M. Fink (Eds.), Proceedings of the 5th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2012) (pp. 99–113). http://hdl.handle.net/20.500.12708/54323
    Project: Complex Reason (2010–2014)
  • The Good, the Bad, and the Odd: Cycles in Answer-Set Programs / Fichte, J. K. (2012). The Good, the Bad, and the Odd: Cycles in Answer-Set Programs. In D. Lassiter & M. Slavkovik (Eds.), Lecture Notes in Computer Science (pp. 78–90). Springer LNCS. https://doi.org/10.1007/978-3-642-31467-4_6
    Project: Complex Reason (2010–2014)
  • Valued-Based Argumentation for Tree-like Value Graphs / Kim, E. J., & Ordyniak, S. (2012). Valued-Based Argumentation for Tree-like Value Graphs. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Fourth International Conference on Computational Models of Argument (Comma 2012) (pp. 378–389). IOS Press. http://hdl.handle.net/20.500.12708/54321
    Projects: Complex Reason (2010–2014) / Complexity (2011–2013)
  • k-Gap Interval Graphs / Fomin, F. V., Gaspers, S., Golovach, P., Suchan, K., Szeider, S., van Leeuwen, E. J., Vatshelle, M., & Villanger, Y. (2012). k-Gap Interval Graphs. In D. Fernández-Baca (Ed.), LATIN 2012: Theoretical Informatics (pp. 350–361). Lecture Notes in Computer Science / Springer. https://doi.org/10.1007/978-3-642-29344-3_30
    Project: Complex Reason (2010–2014)
  • Strong Backdoors to Nested Satisfiability / Gaspers, S., & Szeider, S. (2012). Strong Backdoors to Nested Satisfiability. In A. Cimatti & R. Sebastiani (Eds.), Proceedings of the Fifteen International Conference on Theory and Applications of Satisfiability Testing (SAT 2012) (pp. 58–71). LNCS / Springer. http://hdl.handle.net/20.500.12708/54319
    Project: Complex Reason (2010–2014)
  • Computing Resolution-Path Dependencies in Linear Time , / Slivovsky, F., & Szeider, S. (2012). Computing Resolution-Path Dependencies in Linear Time ,. In A. Cimatti & R. Sebastiani (Eds.), Theory and Applications of Satisfiability Testing – SAT 2012 (pp. 58–71). LNCS / Springer. https://doi.org/10.1007/978-3-642-31612-8_6
    Project: Complex Reason (2010–2014)
  • Backdoors to Acyclic SAT / Gaspers, S., & Szeider, S. (2012). Backdoors to Acyclic SAT. In Automata, Languages, and Programming (pp. 363–374). Springer-Verlag. https://doi.org/10.1007/978-3-642-31594-7_31
    Project: Complex Reason (2010–2014)
  • Don't Be Strict in Local Search! / Gaspers, S., Kim, E. J., Ordyniak, S., Saurabh, S., & Szeider, S. (2012). Don’t Be Strict in Local Search! In J. Hoffmann & B. Selman (Eds.), Proceedings of the 26th Conference on Artificial Intelligence (AAAI 2012) (pp. 486–492). AAAI Press. http://hdl.handle.net/20.500.12708/54316
    Projects: Complex Reason (2010–2014) / Complexity (2011–2013)
  • On Finding Optimal Polytrees / Gaspers, S., Koivisto, M., Liedloff, M., Ordyniak, S., & Szeider, S. (2012). On Finding Optimal Polytrees. In J. Hoffmann & B. Selman (Eds.), Proceedings of the 26th Conference on Artificial Intelligence (AAAI 2012) (pp. 750–756). AAAI Press. http://hdl.handle.net/20.500.12708/54315
    Project: Complex Reason (2010–2014)
  • The Complexity of Planning Revisited - A Parameterized Analysis / Bäckström, C., Chen, Y., Jonsson, P., Ordyniak, S., & Szeider, S. (2012). The Complexity of Planning Revisited - A Parameterized Analysis. In J. Hoffmann & B. Selman (Eds.), Proceedings of the 26th Conference on Artificial Intelligence (AAAI 2012) (pp. 1735–1741). AAAI Press. http://hdl.handle.net/20.500.12708/54314
    Project: Complex Reason (2010–2014)
  • Abstract Argumentation via Monadic Second Order Logic / Dvořák, W., Szeider, S., & Woltran, S. (2012). Abstract Argumentation via Monadic Second Order Logic. In E. Hüllermeier, S. Link, T. Fober, & B. Seeger (Eds.), Lecture Notes in Computer Science (pp. 85–98). Lecture Notes in Computer Science / Springer. https://doi.org/10.1007/978-3-642-33362-0_7
    Projects: Argu (2009–2012) / Complex Reason (2010–2014)
  • Towards Practical Query Answering for Horn SHIQ. / Eiter, T., Ortiz de la Fuente, M. M., Simkus, M., Tran, T.-K., & Xiao, G. (2012). Towards Practical Query Answering for Horn SHIQ. In Y. Kazakov, D. Lembo, & F. Wolter (Eds.), Proc. of the 2012 International Workshop on Description Logics (DL 2012) (pp. 158–168). CEUR workshop proceedings. http://hdl.handle.net/20.500.12708/54289
    Projects: Hybride Wissensbasen (2008–2012) / SemDat (2012–2016)
  • Extending Object-Oriented Languages by Declarative Specifications of Complex Objects using Answer-Set Programming / Oetsch, J., Puehrer, J., & Tompits, H. (2012). Extending Object-Oriented Languages by Declarative Specifications of Complex Objects using Answer-Set Programming. In 26th Workshop on Logic Programming (WLP 2012) (pp. 129–137). http://hdl.handle.net/20.500.12708/54278
  • An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions / Oetsch, J., Puehrer, J., & Tompits, H. (2012). An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions. In Technical Communications of the 28th International Conference on Logic Programming (p. 12). LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum für Informatik. http://hdl.handle.net/20.500.12708/54277
    Project: Methods (2009–2013)
  • Annotating Answer-Set Programs in LANA / DE VOS, M., KISA, D. G., OETSCH, J., PÜHRER, J., & TOMPITS, H. (2012). Annotating Answer-Set Programs in LANA. In Theory and Practice of Logic Programming (pp. 619–637). Cambridge University Press. https://doi.org/10.1017/s147106841200021x
  • On the Small-Scope Hypothesis for Testing Answer-Set Programs / Oetsch, J., Prischink, M., Puehrer, J., Schwengerer, M., & Tompits, H. (2012). On the Small-Scope Hypothesis for Testing Answer-Set Programs. In 13th International Conference on Principles of Knowledge Representation and Reasoning (pp. 43–53). AAAI Press. http://hdl.handle.net/20.500.12708/54275
    Project: Methods (2009–2013)
  • LANA: A Language for Annotating Answer-Set Programs / De Vos, M., Kisa, D. G., Oetsch, J., Puehrer, J., & Tompits, H. (2012). LANA: A Language for Annotating Answer-Set Programs. In 14th International Workshop on Non-Monotonic Reasoning (p. 9). http://hdl.handle.net/20.500.12708/54274
    Project: Methods (2009–2013)
  • Eliminating Unfounded Set Checking for HEX-Programs / Eiter, T., Fink, M., Krennwallner, T., Redl, C., & Schüller, P. (2012). Eliminating Unfounded Set Checking for HEX-Programs. In M. Fink & Y. Lierler (Eds.), Proceedings of Answer Set Programming and Other Computing Paradigms (ASPOCP 2012), 5th International Workshop, September 4, 2012, Budapest, Hungary (p. 15). CoRR - Computing Research Repository. http://hdl.handle.net/20.500.12708/54189
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012) / Hybride Wissensbasen (2008–2012) / IncMan (2009–2012)
  • Exploiting Unfounded Sets for HEX-Program Evaluation / Eiter, T., Fink, M., Krennwallner, T., Redl, C., & Schüller, P. (2012). Exploiting Unfounded Sets for HEX-Program Evaluation. In L. F. del Cerro, A. Herzig, & J. Mengin (Eds.), Logics in Artificial Intelligence (pp. 160–175). Springer. https://doi.org/10.1007/978-3-642-33353-8_13
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012) / Hybride Wissensbasen (2008–2012) / IncMan (2009–2012)
  • Evaluating Abstract Dialectical Frameworks with ASP / Ellmauthaler, S., & Wallner, J. P. (2012). Evaluating Abstract Dialectical Frameworks with ASP. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Proceedings of Computational Models of Argument - Proceedings of COMMA 2012 (pp. 505–506). IOS Press. http://hdl.handle.net/20.500.12708/54186
  • Utilizing ASP for Generating and Visualizing Argumentation Frameworks / Charwat, G., Wallner, J. P., & Woltran, S. (2012). Utilizing ASP for Generating and Visualizing Argumentation Frameworks. In M. Fink & Y. Lierler (Eds.), 5th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2012) (p. 15). CoRR. http://hdl.handle.net/20.500.12708/54185
  • Fixed-Parameter Algorithms for Finding Minimal Models / Lackner, M., & Pfandler, A. (2012). Fixed-Parameter Algorithms for Finding Minimal Models. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Proceedings of 13#^{th} int. conf. on Principles of Knowledge Representation and Reasoning (p. 11). AAAI Press. http://hdl.handle.net/20.500.12708/54179
    Project: TTPC (2008–2012)
  • Computational Aspects of cf2 and stage2 Argumentation Semantics. / Dvorak, W., & Gaggl, S. (2012). Computational Aspects of cf2 and stage2 Argumentation Semantics. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Proceedings of Fourth International Conference on Computational Models of Argument (pp. 273–284). “Frontiers in Artificial Intelligence and Applications” series/IOS Press. http://hdl.handle.net/20.500.12708/54177
  • Complexity-Sensitive Decision Procedures for Abstract Argumentation / Dvorak, W., Järvisalo, M., Wallner, J. P., & Woltran, S. (2012). Complexity-Sensitive Decision Procedures for Abstract Argumentation. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Proceedings of 13#^{th} int. conf. of Principles of Knowledge Representation and Reasoning (pp. 54–64). AAAI Press. http://hdl.handle.net/20.500.12708/54155
    Project: Argu (2009–2012)
  • Belief Revision within Fragments of Propositional Logic / Creignou, N., Papini, O., Pichler, R., & Woltran, S. (2012). Belief Revision within Fragments of Propositional Logic. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Proceedings of 13#^{th} int. conf. on Principles of Knowledge Representation and Reasoning (p. 11). AAAI Press. http://hdl.handle.net/20.500.12708/54154
    Project: TTPC (2008–2012)
  • Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming / Lierler, Y., & Schüller, P. (2012). Parsing Combinatory Categorial Grammar via Planning in Answer Set Programming. In E. Erdem, J. Lee, Y. Lierler, & D. Pearce (Eds.), Correct Reasoning (pp. 436–453). Springer LNCS. https://doi.org/10.1007/978-3-642-30743-0_30
    Project: IncMan (2009–2012)
  • Towards Semantics-Aware Merge Support in Optimistic Model Versioning / Kaufmann, P., Egly, U., Gabmeyer, S., Kappel, G., Seidl, M., Tompits, H., Widl, M., & Wimmer, M. (2012). Towards Semantics-Aware Merge Support in Optimistic Model Versioning. In Models in Software Engineering (pp. 246–256). Springer LNCS. https://doi.org/10.1007/978-3-642-29645-1_24
    Projects: Boolean (2011–2019) / FAME (2011–2014)
  • Uniform Evaluation of Nonmonotonic DL-Programs / Eiter, T., Krennwallner, T., Schneider, P., & Xiao, G. (2012). Uniform Evaluation of Nonmonotonic DL-Programs. In T. Lukasiewicz & A. Sali (Eds.), Lecture Notes in Computer Science (pp. 1–22). Springer. https://doi.org/10.1007/978-3-642-28472-4_1
    Projects: HEX-Programme (2008–2012) / Hybride Wissensbasen (2008–2012)
  • Towards Scenario-Based Testing of UML Diagrams / Kaufmann, P., Egly, U., Gabmeyer, S., Kappel, G., Seidl, M., Tompits, H., Widl, M., & Wimmer, M. (2012). Towards Scenario-Based Testing of UML Diagrams. In Tests and Proofs (pp. 149–155). Springer. https://doi.org/10.1007/978-3-642-30473-6_12
    Projects: Boolean (2011–2019) / FAME (2011–2014)
  • Datalog and Its Extensions for Semantic Web Databases / Gottlob, G., Orsi, G., Pieris, A., & Šimkus, M. (2012). Datalog and Its Extensions for Semantic Web Databases. In T. Eiter & T. Krennwallner (Eds.), Lecture Notes in Computer Science (pp. 54–77). Springer LNCS. https://doi.org/10.1007/978-3-642-33158-9_2
  • Reasoning and Query Answering in Description Logics / Ortiz, M., & Šimkus, M. (2012). Reasoning and Query Answering in Description Logics. In T. Eiter & T. Krennwallner (Eds.), Lecture Notes in Computer Science (pp. 1–53). Springer LNCS. https://doi.org/10.1007/978-3-642-33158-9_1
    Projects: Hybride Wissensbasen (2008–2012) / SemDat (2012–2016)
  • Answer Set Programming with External Sources / Redl, C. (2012). Answer Set Programming with External Sources. In A. Dovier & V. S. Costa (Eds.), Technical Communications of the 28th International Conference on Logic Programming (pp. 469–475). Leibniz International Proceedings in Informatics / Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. http://hdl.handle.net/20.500.12708/54420
    Project: ASP (2012–2015)
  • Inconsistency Measurement based on Variables in Minimal Unsatisfiable Subsets / Xiao, G., & Ma, Y. (2012). Inconsistency Measurement based on Variables in Minimal Unsatisfiable Subsets. In C. Bessiere, L. D. Raedt, D. Dubois, P. Doherty, P. Frasconi, F. Heintz, & P. Lucas (Eds.), Proceedings of 20th European Conference on Artificial Intelligence (pp. 864–869). IOS Press. http://hdl.handle.net/20.500.12708/54367
    Project: Hybride Wissensbasen (2008–2012)
  • Query Rewriting for Horn-SHIQ Plus Rules / Eiter, T., Ortiz de la Fuente, M. M., Simkus, M., Tran, T.-K., & Xiao, G. (2012). Query Rewriting for Horn-SHIQ Plus Rules. In J. Hoffmann & B. Selman (Eds.), Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (pp. 726–733). AAAI Press. http://hdl.handle.net/20.500.12708/54357
    Projects: Hybride Wissensbasen (2008–2012) / Net2 (2010–2013) / SemDat (2012–2016)
  • A Framework for the Specification of Random SAT and QSAT Formulas / Creignou, N., Egly, U., & Seidl, M. (2012). A Framework for the Specification of Random SAT and QSAT Formulas. In Proceedings of the 6th International Conference on Tests and Proofs (TAP 2012) (pp. 163–168). Springer. http://hdl.handle.net/20.500.12708/54164
    Project: FAME (2011–2014)
  • Improving HEX-Program Evaluation based on Unfounded Sets / Eiter, T., Fink, M., Krennwallner, T., Redl, C., & Schüller, P. (2012). Improving HEX-Program Evaluation based on Unfounded Sets (RR-1843-12-08). http://hdl.handle.net/20.500.12708/37793
    Project: ASP (2012–2015)
  • Abstract Argumentation via Monadic Second Order Logic. / Dvorak, W., Szeider, S., & Woltran, S. (2012). Abstract Argumentation via Monadic Second Order Logic. (DBAI-TR-2012-79). http://hdl.handle.net/20.500.12708/37417
    Projects: Argu (2009–2012) / Complex Reason (2010–2014)
  • Finding Explanations of Inconsistency in Multi-Context Systems / Eiter, T., Fink, M., Schüller, P., & Weinzierl, A. (2012). Finding Explanations of Inconsistency in Multi-Context Systems (INFSYS RR-1843-12-09). http://hdl.handle.net/20.500.12708/37697
    Project: IncMan (2009–2012)
  • Managing Inconsistency in Multi-Context Systems using the IMPL Policy Language / Eiter, T., Fink, M., Ianni, G., & Schüller, P. (2012). Managing Inconsistency in Multi-Context Systems using the IMPL Policy Language (INFSYS RR-1843-12-05). http://hdl.handle.net/20.500.12708/37696
    Project: IncMan (2009–2012)
  • A Paraconsistent Semantics for Hybrid Theories / Fink, M. (2012). A Paraconsistent Semantics for Hybrid Theories (INFSYS RR-1843-12-02). http://hdl.handle.net/20.500.12708/37695
    Project: IncMan (2009–2012)
  • Proceedings of Answer Set Programming and Other Computing Paradigms (ASPOCP 2012), 5th International Workshop, September 4, 2012, Budapest, Hungary / Fink, M., & Lierler, Y. (Eds.). (2012). Proceedings of Answer Set Programming and Other Computing Paradigms (ASPOCP 2012), 5th International Workshop, September 4, 2012, Budapest, Hungary. Computing Research Repository (CoRR). http://hdl.handle.net/20.500.12708/23626
  • Fourth International Conference on Computational Models of Argument (COMMA 2012) / Verheij, B., Szeider, S., & Woltran, S. (Eds.). (2012). Fourth International Conference on Computational Models of Argument (COMMA 2012). IOS Press. http://hdl.handle.net/20.500.12708/23575
    Project: Complex Reason (2010–2014)
  • Simulating Production Rules Using ACTHEX / Eiter, T., Feier, C., & Fink, M. (2012). Simulating Production Rules Using ACTHEX. In E. Erdem, J. Lee, Y. Lierler, & D. Pearce (Eds.), Correct Reasoning (pp. 211–228). Springer, LNCS 7265. https://doi.org/10.1007/978-3-642-30743-0_15
  • Backdoors to Satisfaction / Gaspers, S., & Szeider, S. (2012). Backdoors to Satisfaction. In H. L. Bodlaender, R. G. Downey, F. Fomin, & D. Marx (Eds.), The Multivariate Algorithmic Revolution and Beyond (pp. 287–317). Springer LNCS. https://doi.org/10.1007/978-3-642-30891-8_15
    Project: Complex Reason (2010–2014)
  • Stepwise Debugging of Description-Logic Programs / Oetsch, J., Puehrer, J., & Tompits, H. (2012). Stepwise Debugging of Description-Logic Programs. In Correct Reasoning - Essays on Logic-Based AI in Honour of Vladimir Lifschitz (pp. 492–508). Springer, LNCS 7265. http://hdl.handle.net/20.500.12708/27700
    Project: Methods (2009–2013)
  • Reasoning Web. Semantic Technologies for Advanced Query Answering / Reasoning Web. Semantic Technologies for Advanced Query Answering. (2012). In T. Eiter & T. Krennwallner (Eds.), Lecture Notes in Computer Science. Springer LNCS 7487. https://doi.org/10.1007/978-3-642-33158-9
    Projects: ASP (2012–2015) / HEX-Programme (2008–2012) / Hybride Wissensbasen (2008–2012) / MyITS (2011–2013) / Net2 (2010–2013)
  • The Added Value of Argumentation / Modgil, S., Toni, F., Bex, F., Bratko, I., Chesñevar, C. I., Dvořák, W., Falappa, M. A., Fan, X., Gaggl, S. A., García, A. J., González, M. P., Gordon, T. F., Leite, J., Možina, M., Reed, C., Simari, G. R., Szeider, S., Torroni, P., & Woltran, S. (2012). The Added Value of Argumentation. In S. Ossowski (Ed.), Agreement Technologies (pp. 357–403). Springer Netherlands. https://doi.org/10.1007/978-94-007-5583-3_21
  • Workshop Notes of the 4th International Workshop on Acquisition, Representation and Reasoning with Contextualized Knowledge ARCOE-12 August 28, 2012 Montpellier, France / Fink, M., Homola, M., Mileo, A., & Varzinczak, I. (Eds.). (2012). Workshop Notes of the 4th International Workshop on Acquisition, Representation and Reasoning with Contextualized Knowledge ARCOE-12 August 28, 2012 Montpellier, France. Online Publication. http://hdl.handle.net/20.500.12708/23603
  • Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012 / Brewka, G., Eiter, T., & McIlraith, S. (Eds.). (2012). Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, KR 2012. AAAI Press. http://hdl.handle.net/20.500.12708/23590

2011

2010

2009

2008

2007

2006

  • Reasoning Under Minimal Upper Bounds in Propositional Logic / Eiter, T., & Gottlob, G. (2006). Reasoning Under Minimal Upper Bounds in Propositional Logic. Theoretical Computer Science, 369, 82–115. http://hdl.handle.net/20.500.12708/173436
  • Towards Automated Integration of Guess and Check Programs in Answer Set Programming: A Meta-Interpreter and Applications / Eiter, T., & Polleres, A. F. (2006). Towards Automated Integration of Guess and Check Programs in Answer Set Programming: A Meta-Interpreter and Applications. Theory and Practice of Logic Programming, 6(1–2), 23–60. http://hdl.handle.net/20.500.12708/173435
  • Causes and Explanations in the Structural-Model Approach: Tractable Cases / Eiter, T., & Lukasiewicz, T. (2006). Causes and Explanations in the Structural-Model Approach: Tractable Cases. Artificial Intelligence, 170(6–7), 542–580. http://hdl.handle.net/20.500.12708/173415
  • Temporal phylogenetic networks and logic programming / Erdem, E., Lifschitz, V., & Ringe, D. (2006). Temporal phylogenetic networks and logic programming. Theory and Practice of Logic Programming, 6(5), 539–558. http://hdl.handle.net/20.500.12708/173412
  • The DLV System for knowledge representation and reasoning / Leone, N., Pfeifer, G., Faber, W., Eiter, T., Gottlob, G., Perri, S., & Scarcello, F. (2006). The DLV System for knowledge representation and reasoning. ACM Transactions on Computational Logic, VOL. 7(3), 499–562. http://hdl.handle.net/20.500.12708/173399
  • SPAR2QL: From SPARQL to Rules / Polleres, A. F., & Schindlauer, R. (2006). SPAR2QL: From SPARQL to Rules. 5th International Semantic Web Conference (ISWC 2005), Athens, GA, USA, Non-EU. http://hdl.handle.net/20.500.12708/84548
  • dlvhex - A Tool for Semantic Web Reasoning under the Answer-Set Semantics / Schindlauer, R. (2006). dlvhex - A Tool for Semantic Web Reasoning under the Answer-Set Semantics. Second International Summer School Reasoning Web 2006, Lissabon, Portugal, EU. http://hdl.handle.net/20.500.12708/84547
  • Replacements in Non-Ground Answer-Set Programming / Woltran, S. (2006). Replacements in Non-Ground Answer-Set Programming. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84538
  • Replacements in Non-Ground Answer-Set Programming / Woltran, S. (2006). Replacements in Non-Ground Answer-Set Programming. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84537
  • Complexity Results for Checking Equivalence of Stratified Logic Programs / Woltran, S. (2006). Complexity Results for Checking Equivalence of Stratified Logic Programs. Seminarvortrag, Regensburg, Germany, EU. http://hdl.handle.net/20.500.12708/84536
  • ccT: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming / Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2006). ccT: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming. In Proceedings. ICLP’06 Workshop: Lash’06, Seattle, Washington, Non-EU. http://hdl.handle.net/20.500.12708/51606
    Project: ModelCVS (2006–2007)
  • An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs / Eiter, T., Traxler, P., & Woltran, S. (2006). An Implementation for Recognizing Rule Replacements in Non-ground Answer-Set Programs. In M. Fisher, W. van der Hoek, B. Konev, & A. Lisitsa (Eds.), Proceedings of the 10th European Conference on Logics in Artificial Intelligence (JELIA 2006) (pp. 477–480). Springer. http://hdl.handle.net/20.500.12708/51589
  • dlvhex: A Tool for Semantic-Web Reasoning under the Answer-Set Semantics / Eiter, T., Ianni, G., Schindlauer, R., & Tompits, H. (2006). dlvhex: A Tool for Semantic-Web Reasoning under the Answer-Set Semantics. In A. F. Polleres, S. Decker, G. Gupta, & J. De Bruijn (Eds.), Informal Proceedings Workshop on Applications of Logic Programming in the Semantic Web and Semantic Web Services (ALPSWS 2006) (pp. 33–39). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/51581
  • dlvhex: A System for Integrating Multiple Semantics in an Answer-Set Programming Framework / Eiter, T., Ianni, G., Schindlauer, R., & Tompits, H. (2006). dlvhex: A System for Integrating Multiple Semantics in an Answer-Set Programming Framework. In M. Fink, H. Tompits, & S. Woltran (Eds.), Proceedings 20th Workshop on Logic Programming and Constraint Systems (WLP ’06) (pp. 206–210). http://hdl.handle.net/20.500.12708/51580
  • Effective Integration of Declarative Rules with External Evaluations for Semantic Web Reasoning / Eiter, T., Ianni, G., Schindlauer, R., & Tompits, H. (2006). Effective Integration of Declarative Rules with External Evaluations for Semantic Web Reasoning. In Y. Sure & J. Domingue (Eds.), The Semantic Web: Research and Applications. Proceedings 3rd European Conference on Semantic Web (ESWC 2006) (pp. 273–287). Lecture Notes in Computer Science. Springer. http://hdl.handle.net/20.500.12708/51579
  • Forgetting and Conflict Resolving in Disjunctive Logic Programming / Eiter, T., & Wang, K. (2006). Forgetting and Conflict Resolving in Disjunctive Logic Programming. In Proceedings 21th National Conference on Artificial Intelligence (AAAI ’06), July 16-23, 2006, Boston (pp. 238–243). AAAI Press. http://hdl.handle.net/20.500.12708/51575
  • Representing action domains with numeric-valued fluents / Erdem, E., & Gabaldon, A. (2006). Representing action domains with numeric-valued fluents. In M. Fisher, W. van der Hoek, B. Konev, & A. Lisitsa (Eds.), Proceedings 10th European Conference on Logics in Artificial Intelligence, JELIA 2006, Liverpool, UK, September 13--15, 2006 (pp. 151–163). Springer. http://hdl.handle.net/20.500.12708/51564
  • A Tool for Answering Queries on Action Descriptions / Eiter, T., Fink, M., & Senko, J. (2006). A Tool for Answering Queries on Action Descriptions. In M. Fisher, W. van der Hoek, B. Konev, & A. Lisitsa (Eds.), Proceedings 10th European Conference on Logics in Artificial Intelligence, JELIA 2006, Liverpool, UK, September 13--15, 2006 (pp. 473–476). Springer. http://hdl.handle.net/20.500.12708/51563
  • Comparing Action Descriptions Based on Semantic Preferences / Eiter, T., Erdem, E., Fink, M., & Senko, J. (2006). Comparing Action Descriptions Based on Semantic Preferences. In M. Fisher, W. van der Hoek, B. Konev, & A. Lisitsa (Eds.), Proceedings 10th European Conference on Logics in Artificial Intelligence, JELIA 2006, Liverpool, UK, September 13 -- 15, 2006 (pp. 124–137). Springer. http://hdl.handle.net/20.500.12708/51562
  • A Fully Internalized Sequent Calculus for Hybrid Categorial Logics / Ortiz de la Fuente, M. M. (2006). A Fully Internalized Sequent Calculus for Hybrid Categorial Logics. In J. Huitink & S. Katrenko (Eds.), Proceedings of the Eleventh ESSLLI Student Session (pp. 136–147). http://hdl.handle.net/20.500.12708/51783
  • An Approach to Probabilistic Data Integration for the Semantic Web / Cali, A., & Lukasiewicz, T. (2006). An Approach to Probabilistic Data Integration for the Semantic Web. In P. C. G. da Costa, K. B. Laskey, K. J. Laskey, F. Fung, & M. Pool (Eds.), Proceedings of the ISWC-2006 Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2006) (pp. 67–68). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/51718
  • Variable-Strength Conditional Preferences for Ranking Objects in Ontologies / Lukasiewicz, T., & Schellhase, J. (2006). Variable-Strength Conditional Preferences for Ranking Objects in Ontologies. In Y. Sure & J. Domingue (Eds.), Proceedings of the 3rd European Semantic Web Conference (ESWC 2006), Budva, Montenegro, June 2006 (pp. 288–302). Lecture Notes in Computer Science. Springer. http://hdl.handle.net/20.500.12708/51712
  • On Representational Issues about Combinations of Classical Theories with Nonmonotonic Rules / De Bruijn, J., Eiter, T., Polleres, A. F., & Tompits, H. (2006). On Representational Issues about Combinations of Classical Theories with Nonmonotonic Rules. In J. Lang, F. Lin, & J. Wang (Eds.), Proceedings of the First International Conference on Knowledge Science, Engineering and Management (KSEM 2006) (pp. 1–22). Lecture Notes in Computer Science, Springer. http://hdl.handle.net/20.500.12708/51660
  • LPForget: A System of Forgetting in Answer Set Programming / Cheng, F.-L., Eiter, T., Robinson, N., Sattar, A., & Wang, K. (2006). LPForget: A System of Forgetting in Answer Set Programming. In AI 2006: Advances in Artificial Intelligence. Proceedings 19th Australian Joint Conference on Artificial Intelligence. Lecture Notes in Computer Science. (pp. 1101–1105). Lecture Notes in Computer Science. Springer. http://hdl.handle.net/20.500.12708/51659
  • Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics / Ortiz de la Fuente, M. M., Calvanese, D., & Eiter, T. (2006). Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics. In Proceedings 21th National Conference on Artificial Intelligence (AAAI ’06), July 16-23, 2006, Boston, USA ISBN 978-1-57735-281-5 (pp. 275–280). AAAI Press. http://hdl.handle.net/20.500.12708/51654
  • Reasoning with Rules and Ontologies / Eiter, T., Ianni, G., Polleres, A. F., Schindlauer, R., & Tompits, H. (2006). Reasoning with Rules and Ontologies. In P. Barahona, F. Bry, E. Franconi, N. Henze, & U. Sattler (Eds.), Lecture Notes in Computer Science. Reasoning Web (pp. 93–127). Lecture Notes in Computer Science. Springer. http://hdl.handle.net/20.500.12708/51647
  • A RuleML Syntax for Answer-Set Programming / Eiter, T., Ianni, G., Schindlauer, R., & Tompits, H. (2006). A RuleML Syntax for Answer-Set Programming. In A. F. Polleres, S. Decker, G. Gupta, & J. De Bruijn (Eds.), Informal Proceedings Workshop on Applications of Logic Programming in the Semantic Web and Semantic Web Services (ALPSWS 2006), at FLOC/ICLP 2006. (pp. 107–108). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/51748
  • Preferences, Links, and Probabilities for Ranking Objects in Ontologies / Lukasiewicz, T., & Schellhase, J. (2006). Preferences, Links, and Probabilities for Ranking Objects in Ontologies. In P. C. G. da Costa, K. B. Laskey, K. J. Laskey, F. Fung, & M. Pool (Eds.), Proceedings of the ISWC-2006 Workshop on Uncertainty Reasoning for the Semantic Web (URSW 2006) (pp. 65–66). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/51719
  • Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web / Lukasiewicz, T. (2006). Fuzzy Description Logic Programs under the Answer Set Semantics for the Semantic Web. In T. Eiter, E. Franconi, R. Hodgson, & S. Stephens (Eds.), Proceedings of the 2nd International Conference on Rules and Rule Markup Languages for the Semantic Web (RuleML 2006) (pp. 89–96). IEEE Computer Society. http://hdl.handle.net/20.500.12708/51717
  • Adaptive Multi-Agent Programming in GTGolog / Finzi, A., & Lukasiewicz, T. (2006). Adaptive Multi-Agent Programming in GTGolog. In G. Brewka, S. Coradeschi, A. Perini, & P. Traverso (Eds.), Proceedings of the 17th biennial European Conference on Artificial Intelligence (ECAI 2006) (pp. 753–754). IOS Press. http://hdl.handle.net/20.500.12708/51716
  • Game-Theoretic Agent Programming in Golog under Partial Observability / Finzi, A., & Lukasiewicz, T. (2006). Game-Theoretic Agent Programming in Golog under Partial Observability. In C. Freksa, M. Kohlhase, & K. Schill (Eds.), Proceedings of the 29th Annual German Conference on Artificial Intelligence (KI 2006), Bremen, Germany, June 2006. (pp. 113–127). Lecture Notes in Computer Science, Springer. http://hdl.handle.net/20.500.12708/51715
  • Adaptive Multi-Agent Programming in GTGolog / Finzi, A., & Lukasiewicz, T. (2006). Adaptive Multi-Agent Programming in GTGolog. In C. Freksa, M. Kohlhase, & K. Schill (Eds.), Proceedings of the 29th Annual German Conference on Artificial Intelligence (KI 2006), Bremen, Germany, June 2006. (pp. 389–403). Lecture Notes in Computer Science. Springer. http://hdl.handle.net/20.500.12708/51714
  • Variable-Strength Conditional Preferences for Matchmaking in Description Logics / Lukasiewicz, T., & Schellhase, J. (2006). Variable-Strength Conditional Preferences for Matchmaking in Description Logics. In P. Doherty, J. Mylopoulos, & C. Welty (Eds.), Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR 2006), Lake District, UK, June 2006. (pp. 164–174). AAAI Press. http://hdl.handle.net/20.500.12708/51713
  • dlvhex: A Prover for Semantic-Web Reasoning under Answer-Set Semantics / Eiter, T., Ianni, G., Schindlauer, R., & Tompits, H. (2006). dlvhex: A Prover for Semantic-Web Reasoning under Answer-Set Semantics. In T. Nishida, Z. Shi, U. Visser, X. Wu, J. Liu, B. Wah, W. Cheung, & Y.-M. Cheung (Eds.), Proceedings The 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI-06) (pp. 1073–1074). IEEE Computer Society Press. http://hdl.handle.net/20.500.12708/51711
  • Forgetting and Conflict Resolving in Disjunctive Logic Programming / Eiter, T., & Wang, K. (2006). Forgetting and Conflict Resolving in Disjunctive Logic Programming. In J. Dix & A. Hunter (Eds.), Proceedings 11th International Workshop on Nonmonotonic Reasoning (NMR-2006), Reasoning About Actions and Change Track (pp. 85–92). Institut fuer Informatik, TU Clausthal, Germany. http://hdl.handle.net/20.500.12708/51658
  • Data Complexity of Answering Unions of Conjunctive Queries in SHIQ / Ortiz de la Fuente, M. M., Calvanese, D., & Eiter, T. (2006). Data Complexity of Answering Unions of Conjunctive Queries in SHIQ. In B. Parsi, U. Sattler, & D. Toman (Eds.), Proceedings of the 2006 International Workshop on Description Logics (DL’06). Windermere, Lake District, UK, May 30-June 1, 2006 (pp. 62–73). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/51655
  • Towards Efficient Evaluation of HEX Programs / Eiter, T., Ianni, G., Schindlauer, R., & Tompits, H. (2006). Towards Efficient Evaluation of HEX Programs. In J. Dix & A. Hunter (Eds.), Proceedings of the 11th Workshop on Nonmonotonic Reasoning (pp. 40–46). Clausthal University of Technology. http://hdl.handle.net/20.500.12708/51648
  • Forgetting in Managing Rules and Ontologies / Eiter, T., Ianni, G., Schindlauer, R., Tompits, H., & Wang, K. (2006). Forgetting in Managing Rules and Ontologies. In T. Nishida, Z. Shi, U. Visser, X. Wu, J. Liu, B. Wah, W. Cheung, & Y.-M. Cheung (Eds.), Proceedings The 2006 IEEE/WIC/ACM International Conference on Web Intelligence (WI-06) (pp. 411–419). IEEE Computer Society Press. http://hdl.handle.net/20.500.12708/51645
  • Forgetting in Managing Rules and Ontologies / Eiter, T., Ianni, G., Schindlauer, R., Tompits, H., & Wang, K. (2006). Forgetting in Managing Rules and Ontologies. In A. F. Polleres, S. Decker, G. Gupta, & J. De Bruijn (Eds.), Informal Proceedings Workshop on Applications of Logic Programming in the Semantic Web and Semantic Web Services (ALPSWS 2006) (pp. 1–16). CEUR Workshop Proceedings. http://hdl.handle.net/20.500.12708/51641
  • Phase Transition for Random Quantified XOR-formulas / Creignou, N., Daude, H., & Egly, U. (2006). Phase Transition for Random Quantified XOR-formulas. In Proceedings of the Guangzhou Symposioum on Satisfiability in Logic-Based Modeling (p. 12). http://hdl.handle.net/20.500.12708/51625
  • A Solver for QBFs in Nonprenex Form: Overview and Experimental Results / Egly, U., Seidl, M., & Woltran, S. (2006). A Solver for QBFs in Nonprenex Form: Overview and Experimental Results. In Proceedings of the Guangzhou Symposioum on Satisfiability in Logic-Based Modeling (p. 11). http://hdl.handle.net/20.500.12708/51624
    Project: ModelCVS (2006–2007)
  • ccT: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming / Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2006). ccT: A Tool for Checking Advanced Correspondence Problems in Answer-Set Programming. In Proceedings of CIC-06 (pp. 3–11). IEEE Computer Society. http://hdl.handle.net/20.500.12708/51609
    Project: ModelCVS (2006–2007)
  • A Preference-Based Framework for Updating Logic Programs: Preliminary Report / Delgrande, J. P., Schaub, T., & Tompits, H. (2006). A Preference-Based Framework for Updating Logic Programs: Preliminary Report. In E. Pontelli & T. C. Son (Eds.), Informal Proceedings Workshop on Preferences and their Applications in Logic Programming (PREFS 2006) (p. 15). FLOC-Workshop on Preferences and their Applications in Logic Programming (PREFS 2006). http://hdl.handle.net/20.500.12708/51592
  • Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas / Egly, U., & Woltran, S. (2006). Reasoning in Argumentation Frameworks Using Quantified Boolean Formulas. In P. E. Dunne & T. J. M. Bench-Capon (Eds.), Proceedings of the 1st International Conference on Computational Models of Argument (COMMA 2006) (pp. 133–144). IOS Press. http://hdl.handle.net/20.500.12708/51590
  • Replacements in Non-Ground Answer-Set Programming / Eiter, T., Fink, M., Tompits, H., Traxler, P., & Woltran, S. (2006). Replacements in Non-Ground Answer-Set Programming. In P. Doherty, J. Mylopoulos, & C. Welty (Eds.), Proceedings of the 10th International Conference on Principles of Knowledge Representation and Reasoning (KR 2006), Lake District of the United Kingdom, June 2--5 (pp. 340–351). AAAI Press. http://hdl.handle.net/20.500.12708/51567
  • Replacements in Non-Ground Answer-Set Programming / Eiter, T., Fink, M., Tompits, H., Traxler, P., & Woltran, S. (2006). Replacements in Non-Ground Answer-Set Programming. In M. Fink, H. Tompits, & S. Woltran (Eds.), Proceedings of the 20th Workshop on Logic Programming (WLP 2006), Vienna, Austria, February 22--24 (p. 9). TU Wien, Institut fuer Informationssysteme. http://hdl.handle.net/20.500.12708/51566
  • Comparing Action Descriptions Based on Semantic Preferences / Eiter, T., Erdem, E., Fink, M., & Senko, J. (2006). Comparing Action Descriptions Based on Semantic Preferences. In U. Junker & W. Kiessling (Eds.), Informal Proceedings Multidisciplinary Workshop on Advances in Preference Handling, ECAI 2006, Riva del Garda, August 28 -- 29, 2006 (pp. 15–22). http://hdl.handle.net/20.500.12708/51561
  • Resolving Conflicts in Action Descriptions / Eiter, T., Erdem, E., Fink, M., & Senko, J. (2006). Resolving Conflicts in Action Descriptions. In G. Brewka, S. Coradeschi, A. Perini, & P. Traverso (Eds.), Proceedings of the 17th Eureopean Conference on Artificial Intelligence, ECAI’2006, Riva del Garda, Italy, August 29 -- September 1, 2006 (pp. 367–371). IOS Press. http://hdl.handle.net/20.500.12708/51560
  • Resolving Conflicts in Action Descriptions / Eiter, T., Erdem, E., Fink, M., & Senko, J. (2006). Resolving Conflicts in Action Descriptions. In J. Dix & A. Hunter (Eds.), Proceedings 11th International Workshop on Nonmonotonic Reasoning (NMR-2006), Reasoning About Actions and Change Track (pp. 353–360). TU Clausthal, Institut fuer Informatik. http://hdl.handle.net/20.500.12708/51557
  • Algorithmic Aspectc of Model Representations / Pichler, R. (2006). Algorithmic Aspectc of Model Representations. In M. Fink, H. Tompits, & S. Woltran (Eds.), 20th Workshop on Logic Programming (WLP2006) (pp. 12–20). INFSYS Research Report. http://hdl.handle.net/20.500.12708/51472
  • A Tool for Advanced Correspondence Checking in Answer-Set Programming / Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2006). A Tool for Advanced Correspondence Checking in Answer-Set Programming. In Proceedings is for the Eleventh International Workshop on Nonmonotonic Reasoning. 11th International Workshop on Nonmonotonic Reasoning, Lake District, UK, EU. http://hdl.handle.net/20.500.12708/51451
    Project: ModelCVS (2006–2007)
  • A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results / Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2006). A Tool for Advanced Correspondence Checking in Answer-Set Programming: Preliminary Experimental Results. In Online Proceedings - WLP 2006. 20th Workshop on Logic Programming, Wien, EU. http://hdl.handle.net/20.500.12708/51450
    Project: ModelCVS (2006–2007)
  • ccT: A Correspondence-Checking Tool For Logic Programs Under The Answer-Set Semantics / Oetsch, J., Seidl, M., Tompits, H., & Woltran, S. (2006). ccT: A Correspondence-Checking Tool For Logic Programs Under The Answer-Set Semantics. In Proceedings of the JELIA2006 (pp. 502–505). Springer. http://hdl.handle.net/20.500.12708/51449
    Project: ModelCVS (2006–2007)
  • A Solver for QBFs in Nonprenex Form / Egly, U., Seidl, M., & Woltran, S. (2006). A Solver for QBFs in Nonprenex Form. In Proceedings of the ECAI 2006 (pp. 477–481). IOS Press. http://hdl.handle.net/20.500.12708/51448
    Project: ModelCVS (2006–2007)
  • A Distance-Based Method for the Evaluation of Interest Point Detection Algorithms / Reiterer, A., & Eiter, T. (2006). A Distance-Based Method for the Evaluation of Interest Point Detection Algorithms. In IEEE-Signal Processing Society (Ed.), IEEE International Conference on Image Processing - ICIP 2006 (p. 4). IEEE. http://hdl.handle.net/20.500.12708/41997
  • Data Complexity of Query Answering in Expressive Description Logics with Nominals / Ortiz de la Fuente, M. M., Calvanese, D., & Eiter, T. (2006). Data Complexity of Query Answering in Expressive Description Logics with Nominals (INFSYS RR-1843-06-03). http://hdl.handle.net/20.500.12708/33074
  • A novel combination of answer set programming with description logics for the Semantic Web / Lukasiewicz, T. (2006). A novel combination of answer set programming with description logics for the Semantic Web (INFSYS RR-1843-06-08). http://hdl.handle.net/20.500.12708/33073
  • An Overview of Uncertainty and Vagueness in Description Logics for the Semantic Web / Lukasiewicz, T., & Straccia, U. (2006). An Overview of Uncertainty and Vagueness in Description Logics for the Semantic Web (INFSYS RR-1843-06-07). http://hdl.handle.net/20.500.12708/33072
  • Probabilistic Description Logics for the Semantic Web / Lukasiewicz, T. (2006). Probabilistic Description Logics for the Semantic Web (INFSYS RR-1843-06-05). http://hdl.handle.net/20.500.12708/33071
  • Probabilistic Description Logic Programs / Lukasiewicz, T. (2006). Probabilistic Description Logic Programs (INFSYS RR-1843-06-04). http://hdl.handle.net/20.500.12708/33070
  • Comparing Action Descriptions Based on Semantic Preferences / Eiter, T., Erdem, E., Fink, M., & Senko, J. (2006). Comparing Action Descriptions Based on Semantic Preferences. http://hdl.handle.net/20.500.12708/33066
  • Computational Aspects of Monotone Dualization: A Brief Survey / Eiter, T., Makino, K., & Gottlob, G. (2006). Computational Aspects of Monotone Dualization: A Brief Survey (INFSYS RR-1843-06-01). http://hdl.handle.net/20.500.12708/33067
  • Proceedings of the Second International Conference on Rules and Rule Markup Languages for the Semantic Web / Eiter, T., Franconi, E., Hodgson, R., Kifer, M., & Stephens, S. (Eds.). (2006). Proceedings of the Second International Conference on Rules and Rule Markup Languages for the Semantic Web. IEEE Computer Society Press. http://hdl.handle.net/20.500.12708/22323
  • Proceedings of the 20th Workshop on Logic Programming (WLP 2006), Vienna, Austria, February 22--24 / Fink, M., Tompits, H., & Woltran, S. (Eds.). (2006). Proceedings of the 20th Workshop on Logic Programming (WLP 2006), Vienna, Austria, February 22--24. TU Wien. http://hdl.handle.net/20.500.12708/22322

2005

2004

2003

2002

2000

 

2023

2022

2021

2020

2019

2018

2017

2016

2015

2014

2013

2012

2011

2010

2009

2008

2007

2006

2005

2004

2003

2002

2001

 

  • Thomas Eiter: Alan Robinson 20 Years Test of Time Award
    2023 / Association for Logic Programming / UK
  • Tobias Geibinger: ASAI Master Thesis Prize
    2023 / Austrian Society for Artificial Intelligence (ASAI) / Austria
  • Thomas Eiter: KR 2022 Test of Time Award
    2022 / International Conference on Principles of Knowledge Representation and Reasoning / USA
  • Thomas Eiter: Full Member of the Austrian Academy of Sciences (ÖAW)
    2022 / Mitgliedschaft / Austria
  • Thomas Eiter: ACM Fellow
    2020 / ACM Fellowship / USA
  • Thomas Eiter: Best Paper of the 3rd International Joint Conference on Rules and Reasoning (RuleML+RR 2019)
    2019 / 3rd International Joint Conference on Rules and Reasoning (RuleML+RR 2019), September 16-19, 2019, Bolzano, Italy / Germany
  • Thomas Eiter: Best Systems Paper Award of the 35th International Conference on Logic Programming (ICLP 2019)
    2019 / 35th International Conference on Logic Programming (ICLP 2019), September 22-25, 2019, Las Cruces, New Mexico, USA / UK
  • Thomas Eiter: Best Student Paper of the 15th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2019)
    2019 / 15th International Conference on Logic Programming and Non-monotonic Reasoning (LPNMR 2019), Jun 3-7, 2019, Philadelphia, USA / USA
  • Thomas Eiter: Best Paper Award of the 34th International Conference on Logic Programming (ICLP 2018)
    2018 / 34th International Conference on Logic Programming (ICLP 2018), July 14- 17, 2018, Oxford, UK / UK
  • Thomas Eiter: Best Paper Award of the 14th Extended Semantic Web Conference (ESWC 2017)
    2017 / 14th Extended Semantic Web Conference (ESWC 2017), May 28 - June 1, 2017, Portoroz, Slovenia / Germany
  • Thomas Eiter: Member of Academia Europea (London)
    2016 / Academia Europea (London) Membership / UK
  • Maria Magdalena Ortiz de la Fuente: Distinguished Alumna Award of the European Masters in Computational Logic
    2014 / International Organization
  • Maria Magdalena Ortiz de la Fuente: EMCL Distinguished Alumni Award
    2014 / Joint Consortium of the European Masters in Computational Logic
  • Thomas Eiter: Prominent Paper Award 2013
    2013 / Artificial Intelligence Journal / USA
  • Thomas Eiter: ICLP 2013 Test of the Time Award
    2013 / 29th International Conference on Logic Programming (ICLP 2013), August 24-29, Istanbul, TurkeyURKEY / UK
  • Thomas Eiter: Vienna Content Award 2012 / Smart Cities (MyITS system prototype)
    2012 / Vienna Content Award 2012 / Smart Cities / Austria
  • Maria Magdalena Ortiz de la Fuente: Austrian Federal Ministry for Science and Research: Award of Excellence 2010
    2010 / Austria
  • Thomas Eiter: Corresponding Member of the Austrian Academy of Sciences (ÖAW)
    2007 / Mitgliedschaft / Austria
  • Maria Magdalena Ortiz de la Fuente: OCG-Förderpreis
    2007 / Austria
  • Maria Magdalena Ortiz de la Fuente: The Google Anita Borg Memorial Scholarship
    2007
  • Thomas Eiter: EurAI Fellow
    2006 / Fellowship of the European Association for Artificial Intelligence / Germany
  • Maria Magdalena Ortiz de la Fuente: ÖGAI-Preis
    2006 / Austria
  • Maria Magdalena Ortiz de la Fuente: Best Thesis Award, consortium of the European Masters in Computational Logic
    2006 / International Organization
  • Thomas Eiter: Distinguished Paper Award of the 18th National Conference on Artificial Intelligence (AAAI '02)
    2002 / 18th National Conference on Artificial Intelligence (AAAI '02), July 28 -- August 1, 2002, Edmonton, Alberta (Canada) / Canada
  • Thomas Eiter: Distinguished Paper Award of the 17th International Joint Conference on Artificial Intelligence (IJCAI 2001)
    2001 / 17th International JointConference on Artificial Intelligence (IJCAI 2001), August 4-10, 2001, Seattle, U.S.A. / USA
  • Thomas Eiter: Invention of the Year 1999 Finalist (University of Maryland)
    1999 / Office of Technology Liaison, University of Maryland / USA

Soon, this page will include additional information such as reference projects, conferences, events, and other research activities.

Until then, please visit Knowledge-Based Systems’ research profile in TISS .