| 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 |
| INPUTS, OUTPUTS, AND COMPOSITION IN THE LOGIC OF INFORMATION FLOWS
|
2021 |
Aamer, Heba |
| VERIFYING STRATEGIC ABILITIES OF NEURAL-SYMBOLIC MULTI-AGENT SYSTEMS
|
2021 |
Akintunde, Michael E. |
| EXPLAINABLE ACCEPTANCE IN PROBABILISTIC ABSTRACT ARGUMENTATION: COMPLEXITY AND APPROXIMA TION
|
2021 |
Alfano, Gianvincenzo |
| STABLE AND SUPPORTED SEMANTICS IN CONTINUOUS VECTOR SPACES
|
2021 |
Aspis, Yaniv |
| AN ANSWER SET PROGRAMMING FRAMEWORK FOR REASONING ABOUT AGENTS' BELIEFS AND TRUTHFULNESS OF STATEMENTS
|
2021 |
Balduccini, Marcello |
| A THREE-VALUED APPROACH TO STRATEGIC ABILITIES UNDER IMPERFECT INFORMATION
|
2021 |
Belardinelli, Francesco |
| ORDINAL POLYMATRIX GAMES WITH INCOMPLETE INFORMATION
|
2021 |
Amor, Nahla Ben |
| NON-MONOTONIC ONTOLOGY-BASED ABSTRACTIONS OF DATA SERVICES
|
2021 |
Cima, Gianluca |
| DYADIC OBLIGATIONS OVER COMPLEX ACTIONS AS DEONTIC CONSTRAINTS IN THE SITUATION CALCULUS
|
2021 |
Claßen, Jens |
| NONDETERMINISTIC STRATEGIES AND THEIR REFINEMENT IN STRATEGY LOGIC
|
2021 |
Giacomo, Giuseppe De |
Tag hinzufügen