| 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 |
| 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