| Publication | Date of Publication | Type |
|---|
| The query topology in logic programming | 2022-08-16 | Paper |
| Merging heterogeneous security orderings | 2022-08-16 | Paper |
| Does financial connectedness predict crises? | 2018-09-19 | Paper |
| Heterogeneous temporal probabilistic agents | 2017-07-12 | Paper |
| Probabilistic interval XML | 2017-07-12 | Paper |
| ChoiceGAPs: Competitive Diffusion as a Massive Multi-player Game in Social Networks | 2017-06-20 | Paper |
| Probabilistic agent programs | 2017-06-13 | Paper |
| Diffusion centrality: a paradigm to maximize spread in social networks | 2016-10-14 | Paper |
| Annotated RDF | 2015-09-17 | Paper |
| Annotated Probabilistic Temporal Logic | 2015-09-17 | Paper |
| Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems | 2015-09-17 | Paper |
| Parallel Abductive Query Answering in Probabilistic Logic Programs | 2015-09-17 | Paper |
| Super-Solutions | 2015-09-17 | Paper |
| A temporal database forecasting algebra | 2015-07-10 | Paper |
| Policy-based inconsistency management in relational databases | 2015-07-10 | Paper |
| A General Framework for Reasoning On Inconsistency | 2013-03-20 | Paper |
| Using Histograms to Better Answer Queries to Probabilistic Logic Programs | 2012-11-13 | Paper |
| Focused most probable world computations in probabilistic logic programs | 2012-10-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2909166 | 2012-08-29 | Paper |
| Privacy Preservation Using Multi-context Systems and Default Logic | 2012-07-23 | Paper |
| Using Generalized Annotated Programs to Solve Social Network Optimization Problems | 2012-05-11 | Paper |
| Abductive Inference in Probabilistic Logic Programs | 2012-05-11 | Paper |
| Approximate Achievability in Event Databases | 2011-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2996249 | 2011-05-06 | Paper |
| An AGM-style belief revision mechanism for probabilistic spatio-temporal logics | 2010-03-16 | Paper |
| Computing the fault tolerance of multi-agent deployment | 2009-08-31 | Paper |
| Foundations of Information and Knowledge Systems | 2009-05-14 | Paper |
| Aggregate operators in probabilistic databases | 2008-12-21 | Paper |
| How Dirty Is Your Relational Database? An Axiomatic Approach | 2008-09-16 | Paper |
| Probabilistic temporal databases, I | 2008-06-18 | Paper |
| Flexible support for multiple access control policies | 2008-06-18 | Paper |
| Probabilistic object bases | 2008-06-18 | Paper |
| The Relationship Between Reasoning About Privacy and Default Logics | 2008-05-27 | Paper |
| Computing most probable worlds of action probabilistic logic programs: scalable estimation for \(10^{30,000}\) worlds | 2008-04-21 | Paper |
| Computational Logic in Multi-Agent Systems | 2005-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3046912 | 2004-08-12 | Paper |
| Improving performance of heterogeneous agents | 2004-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4736499 | 2004-08-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414547 | 2003-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707752 | 2003-06-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4797415 | 2003-03-13 | Paper |
| Secure agents | 2003-03-10 | Paper |
| Complexity, decidability and undecidability results for domain-independent planning | 2003-02-04 | Paper |
| Foundations of distributed interaction systems | 2002-06-27 | Paper |
| Meta-agent programs | 2001-10-30 | Paper |
| Temporal agent programs | 2001-08-20 | Paper |
| Applications of paraconsistency in data and knowledge bases | 2001-02-22 | Paper |
| Heterogeneous active agents. III: Polynomially implementable agents | 2000-06-04 | Paper |
| Hybrid probabilistic programs | 2000-05-07 | Paper |
| An algebra for creating and querying multimedia presentations | 2000-01-01 | Paper |
| Heterogeneous active agents, I: Semantics | 1999-04-28 | Paper |
| Heterogeneous active agents, II: Algorithms and complexity | 1999-04-28 | Paper |
| Foundations of multimedia database systems | 1998-01-21 | Paper |
| Amalgamating knowledge bases, III: Algorithms, data structures and query processing | 1997-11-16 | Paper |
| The logic of totally and partially ordered plans: A deductive database approach | 1997-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4342504 | 1997-06-22 | Paper |
| Disjunctive \(LP+\) integrity constraints = stable model semantics. | 1997-05-12 | Paper |
| Annotated nonmonotonic rule systems | 1997-02-28 | Paper |
| A non-ground realization of the stable and well-founded semantics | 1997-02-27 | Paper |
| Computing minimal models by partial instantiation | 1997-02-27 | Paper |
| Multiagent reasoning with probability, time, and beliefs | 1995-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4764116 | 1995-11-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4852889 | 1995-10-25 | Paper |
| Computing circumscriptive databases | 1995-04-10 | Paper |
| Mixed integer programming methods for computing nonmonotonic deductive databases | 1995-04-10 | Paper |
| Stable semantics for probabilistic deductive databases | 1995-01-12 | Paper |
| Computing definite logic programs by partial instantiation | 1994-08-21 | Paper |
| A semantical framework for supporting subjective and conditional probabilities in deductive databases | 1994-03-27 | Paper |
| Dualities between alternative semantics for logic programming and nonmonotonic reasoning | 1994-03-13 | Paper |
| Completeness issues in RUE-NRF deduction: The undecidability of viability | 1994-01-13 | Paper |
| Probabilistic logic programming | 1993-05-16 | Paper |
| Relating minimal models and pre-requisite-free normal defaults | 1993-04-01 | Paper |
| The Paraconsistent Logics PJ | 1993-04-01 | Paper |
| Stable and extension class theory for logic programs and default logics | 1993-01-16 | Paper |
| The relationship between stable, supported, default and autoepistemic semantics for general logic programs | 1993-01-16 | Paper |
| Paraconsistent disjunctive deductive databases | 1992-06-28 | Paper |
| The Paraconsistent Logics PJ | 1992-06-26 | Paper |
| Generalized closed world assumption is \(\Pi ^ 0_ 2\)-complete | 1990-01-01 | Paper |
| Protected completions of first-order general logic programs | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3199402 | 1990-01-01 | Paper |
| A RING-THEORETIC BASIS FOR LOGIC PROGRAMMING | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3486860 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3490992 | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5202173 | 1990-01-01 | Paper |
| Paraconsistent logic programming | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3359740 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3490993 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4204135 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3817650 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4207887 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3768366 | 1987-01-01 | Paper |
