default search action
18th KR 2021
- Meghyn Bienvenu, Gerhard Lakemeyer, Esra Erdem:
Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning, KR 2021, Online event, November 3-12, 2021. 2021, ISBN 978-1-956792-99-7
Full Papers
- Thomas Ågotnes, Yì N. Wáng:
Somebody Knows. 2-11 - Shqiponja Ahmetaj, Robert David
, Magdalena Ortiz, Axel Polleres, Bojken Shehu, Mantas Simkus
Reasoning about Explanations for Non-validation in SHACL. 12-21 - Diego Aineto, Sergio Jiménez, Eva Onaindia:
Generalized Temporal Inference via Planning. 22-31 - Leila Amgoud, Vivien Beuselinck:
Equivalence of Semantics in Argumentation. 32-41 - Benjamin Aminof, Giuseppe De Giacomo, Alessio Lomuscio, Aniello Murano, Sasha Rubin:
Synthesizing Best-effort Strategies under Multiple Environment Specifications. 42-51 - Ofer Arieli, AnneMarie Borg
Characterizations and Classifications of Argumentative Entailments. 52-62 - Alessandro Artale, Andrea Mazzullo, Ana Ozaki, Frank Wolter:
On Free Description Logics with Definite Descriptions. 63-73 - Gilles Audemard, Steve Bellart, Louenas Bounia, Frédéric Koriche, Jean-Marie Lagniez, Pierre Marquis
On the Computational Intelligibility of Boolean Classifiers. 74-86 - Christel Baier
Admissibility in Probabilistic Argumentation. 87-98 - Roman Barták, Simona Ondrcková, Gregor Behnke, Pascal Bercher
Correcting Hierarchical Plans by Action Deletion. 99-109 - Ringo Baumann, Markus Ulbricht
Choices and their Consequences - Explaining Acceptable Sets in Abstract Argumentation Frameworks. 110-119 - Thomas Bolander
DEL-based Epistemic Planning for Human-Robot Collaboration: Theory and Implementation. 120-129 - AnneMarie Borg
Enforcing Sets of Formulas in Structured Argumentation. 130-140 - Camille Bourgaux, David Carral, Markus Krötzsch, Sebastian Rudolph
Capturing Homomorphism-Closed Decidable Queries with Existential Rules. 141-150 - Roman Bresson, Johanne Cohen, Eyke Hüllermeier, Christophe Labreuche, Michèle Sebag:
On the Identifiability of Hierarchical Decision Models. 151-161 - Maxime Buron, Marie-Laure Mugnier, Michaël Thomazo:
Parallelisable Existential Rules: a Story of Pieces. 162-173 - Claudia Cauli, Magdalena Ortiz, Nir Piterman:
Closed- and Open-world Reasoning in DL-Lite for Cloud Infrastructure Security. 174-183 - Lukás Chrpa, Martin Pilát, Jakub Med
On Eventual Applicability of Plans in Dynamic Environments with Cyclic Phenomena. 184-193 - Jens Claßen
An Account of Intensional and Extensional Actions, and its Application to Belief, Nondeterministic Actions and Fallible Sensors. 194-204 - Alexis de Colnet, Stefan Mengel:
A Compilation of Succinctness Results for Arithmetic Circuits. 205-215 - Giuseppe De Giacomo, Yves Lespérance:
The Nondeterministic Situation Calculus. 216-226 - Giuseppe De Giacomo, Aniello Murano, Fabio Patrizi
Timed Trace Alignment with Metric Temporal Logic over Finite Traces. 227-236 - Giuseppe De Giacomo, Antonio Di Stasio
Synthesis with Mandatory Stop Actions. 237-246 - Devendra Singh Dhami, Mayukh Das, Sriraam Natarajan:
Beyond Simple Images: Human Knowledge-Guided GANs for Clinical Data Generation. 247-257 - Dominik Drexler, Jendrik Seipp, Hector Geffner:
Expressing and Exploiting the Common Subgoal Structure of Classical Planning Domains Using Sketches. 258-268 - Thomas Eiter, Markus Hecher, Rafael Kiesel:
Treewidth-Aware Cycle Breaking for Algebraic Answer Set Counting. 269-279 - Thomas Eiter, Tobias Geibinger
Answer-Set Programming for Lexicographical Makespan Optimisation in Parallel Machine Scheduling. 280-290 - Patricia Everaere, Chouaib Fellah, Sébastien Konieczny, Ramón Pino Pérez:
Borda, Cancellation and Belief Merging. 291-300 - Bettina Fazzinga, Sergio Flesca, Filippo Furfaro:
Reasoning over Attack-incomplete AAFs in the Presence of Correlations. 301-311 - Julian Gutierrez, Lewis Hammond, Anthony W. Lin
Rational Verification for Probabilistic Systems. 312-322 - Anneke Haga, Carsten Lutz, Leif Sabellek, Frank Wolter:
How to Approximate Ontology-Mediated Queries. 323-333 - Jesse Heyninck, Ofer Arieli:
Approximation Fixpoint Theory for Non-Deterministic Operators and Its Application in Disjunctive Logic Programming. 334-344 - Jesse Heyninck, Gabriele Kern-Isberner, Tjitze Rienstra, Kenneth Skiba, Matthias Thimm:
Revision and Conditional Inference for Abstract Dialectical Frameworks. 345-355 - Xuanxiang Huang
On Efficiently Explaining Graph-Based Classifiers. 356-367 - Wojciech Jamroga, Wojciech Penczek
Strategic Abilities of Asynchronous Agents: Semantic Side Effects and How to Tame Them. 368-378 - Brendan Juba, Hai S. Le, Roni Stern:
Safe Learning of Lifted Action Models. 379-389 - Jean Christoph Jung
Separating Data Examples by Description Logic Concepts with Restricted Signatures. 390-399 - Magdalena Kacprzak, Artur Niewiadomski, Wojciech Penczek
Satisfiability Checking of Strategy Logic with Simple Goals. 400-410 - Yusuke Kawamoto
Formalizing Statistical Beliefs in Hypothesis Testing Using Program Logic. 411-421 - Atefeh Keshavarzi Zafarghandi, Rineke Verbrugge, Bart Verheij
Semi-Stable Semantics for Abstract Dialectical Frameworks. 422-431 - Spencer Killen, Jia-Huai You:
Unfounded Sets for Disjunctive Hybrid MKNF Knowledge Bases. 432-441 - Gianfranco Lamperti, Marina Zanella, Xiangfu Zhao:
Diagnosis of Active Systems with Abstract Observations and Compiled Knowledge. 442-453 - Ruiqi Li
Unsupervised Novelty Characterization in Physical Environments Using Qualitative Spatial Relations. 454-464 - Daxin Liu
On the Progression of Belief. 465-474 - Robin Manhaeve
Approximate Inference for Neural Probabilistic Logic Programming. 475-486 - Bastien Maubert, Munyque Mittelmann, Aniello Murano, Laurent Perrussel
Strategic Reasoning in Automated Mechanism Design. 487-496 - Robin Nolte, Thomas Schneider:
Properties of Module Notions and Atomic Decomposition. 497-507 - Guilherme Paulino-Passos
Monotonicity and Noise-Tolerance in Case-Based Reasoning with Abstract Argumentation. 508-518 - David Rajaratnam, Michael Thielscher:
Representing and Reasoning with Event Models for Epistemic Planning. 519-528 - Jandson S. Ribeiro
Consolidation via Tacit Culpability Measures: Between Explicit and Implicit Degrees of Culpability. 529-538 - Ivan D. Rodriguez, Blai Bonet, Javier Romero, Hector Geffner:
Learning First-Order Representations for Planning from Black Box States: New Results. 539-548 - Zeynep G. Saribatur, Johannes Peter Wallner:
Existential Abstraction on Argumentation Frameworks via Clustering. 549-559 - Taisuke Sato, Ryosuke Kojima:
Boolean Network Learning in Vector Spaces for Genome-wide Network Analysis. 560-569 - Igor Sedlár:
Decidability and Complexity of Some Finitely-valued Dynamic Logics. 570-580 - Mate Soos, Kuldeep S. Meel:
Gaussian Elimination Meets Maximum Satisfiability. 581-587 - Marlo Souza, Renata Wassermann
Belief Contraction in Non-classical logics as Hyperintensional Belief Change. 588-598 - Timothy van Bremen, Ondrej Kuzelka:
Lifted Inference with Tree Axioms. 599-608 - Przemyslaw Andrzej Walega, David J. Tena Cucala
DatalogMTL with Negation Under Stable Models Semantics. 609-618 - Przemyslaw Andrzej Walega, Michal Zawidzki
Finitely Materialisable Datalog Programs with Metric Temporal Operators. 619-628 - Liuwen Yu
A Principle-based Analysis of Abstract Agent Argumentation Semantics. 629-640
Short Papers
- Stefan Borgwardt, Jörg Hoffmann, Alisa Kovtunova
Making DL-Lite Planning Practical. 641-645 - Angelos Charalambidis, George Papadimitriou, Panos Rondogiannis, Antonis Troumpoukis:
A Many-valued Logic for Lexicographic Preference Representation. 646-650 - Lukás Chrpa, Wolfgang Faber, Michael Morak:
Universal and Uniform Action Reversibility. 651-654 - Carl Corea, Matthias Thimm, Patrick Delfmann:
Measuring Inconsistency over Sequences of Business Rule Cases. 655-660 - Fabio Aurelio D'Asaro
Introducing k-lingo: a k-depth Bounded Version of ASP System Clingo. 661-664 - Marjolein Deryck, Nuno Comenda, Bart Coppens, Joost Vennekens:
Combining Logic and Natural Language Processing to Support Investment Management. 665-670 - Wolfgang Dvorák, Matthias König, Stefan Woltran:
On the Complexity of Preferred Semantics in Argumentation Frameworks with Bounded Cycle Length. 671-675 - Andreas Herzig, Frédéric Maris, Elise Perrotin:
A Dynamic Epistemic Logic with Finite Iteration and Parallel Composition. 676-680 - Andreas Herzig, Antonio Yuste-Ginel
On the Epistemic Logic of Incomplete Argumentation Frameworks. 681-685 - Isabelle Kuhlmann, Tjitze Rienstra, Lars Bengel, Kenneth Skiba, Matthias Thimm:
Distinguishability in Abstract Argumentation. 686-690 - Michael Morak:
Sticky Existential Rules and Disjunction are Incompatible. 691-695 - Patrick Rodler, Erich Teppan, Dietmar Jannach:
Randomized Problem-Relaxation Solving for Over-Constrained Schedules. 696-701 - Philipp Matthias Schäfer, Franz Steinmetz, Stefan Schneyer, Timo Bachmann, Thomas Eiband, Florian Samuel Lay, Abhishek Padalkar, Christoph Sürig, Freek Stulp, Korbinian Nottensteiner:
Flexible Robotic Assembly Based on Ontological Representation of Tasks, Skills, and Resources. 702-706 - Markus Ulbricht
On the Maximal Number of Complete Extensions in Abstract Argumentation Frameworks. 707-711 - Yida Xin, Henry Lieberman, Peter Chin:
PATCHCOMM: Using Commonsense Knowledge to Guide Syntactic Parsers. 712-716
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-23 19:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: