| ANSWER SET PROGRAMMING WITH COMPOSED PREDICATE NAMEBDS
|
2021 |
Alviano, Mario |
| AN OPTIMIZATION APPROACH TO ROBUST GOAL OBFUSCATION
|
2021 |
Bernardini, Sara |
| SPATIAL REASONING ABOUT STRING LOOPS AND HOLES IN TEMPORAL ASP
|
2021 |
Cabalar, Pedro |
| REVISION BY CONDITIONALS: FROM HOOK TO ARROW
|
2021 |
Chandler, Jake |
| A PREFERENCE-BASED APPROACH TO DEFEASIBLE DEONTIC INFERENCE
|
2021 |
Delgrande, James |
| STRATEGY SYNTHESIS FOR DATA-AWARE DYNAMIC SYSTEMS WITH MULTIPLE ACTORS
|
2021 |
Leoni, Massimiliano De |
| JOKES AND BELIEF REVISION
|
2021 |
Saint-Cyr, Florence Dupin De |
| FIXED-PARAMETER TRACTABILITY OF DEPENDENCY QBF WITH STRUCTURAL PARAMETERS
|
2021 |
Ganian, Robert |
| DATALOG REWRITABILITY AND DATA COMPLEXITY OF ALCHOIF WITH CLOSED PREDICATES
|
2021 |
Gogacz, Tomasz |
| LOGICS OF PREFERENCE WHEN THERE IS NO BEST
|
2021 |
Grossi, Davide |
| REASONING WITH CONTEXTUAL KNOWLEDGE AND INFLUENCE DIAGRAMS
|
2021 |
Acar, Erman |
| QUERYING AND REPAIRING INCONSISTENT PRIORITIZED KNOWLEDGE BASES: COMPLEXITY ANALYSIS AND LINKS WITH ABSTRACT ARGUMENTATION
|
2021 |
Bienvenu, Meghyn |
| HIGH-LEVEL PROGRAMMING VIA GENERALIZED PLANNING AND LTL SYNTHESIS
|
2021 |
Bonet, Blai |
| EXPLANATIONS FOR NEGATIVE QUERY ANSWERS UNDER EXISTENTIAL RULES
|
2021 |
Ceylan, Ismail Ilkan |
| REASONING ABOUT MEASURES OF UNMEASURABLE SETS
|
2021 |
Console, Marco |
| LIGHTWEIGHT PARALLEL MULTI-AGENT EPISTEMIC PLANNING
|
2021 |
Cooper, Martin |
| FINE-GRAINED COMPLEXITY OF TEMPORAL PROBLEMS
|
2021 |
Dabrowski, Konrad K. |
| TWO-STAGE TECHNIQUE FOR LTLF SYNTHESIS UNDER LTL ASSUMPTIONS
|
2021 |
Giacomo, Giuseppe De |
| A DATA COMPLEXITY AND REWRITABILITY TETRACHOTOMY OF ONTOLOGY- MEDIATED QUERIES WITH A COVERING AXIOM
|
2021 |
Gerasimova, Olga |
| ON FINITE ENTAILMENT OF NON-LOCAL QUERIES IN DESCRIPTION LOGICS
|
2021 |
Gogacz, Tomasz |
Tag hinzufügen