共 50 条
- [2] Expressiveness vs. complexity in nonmonotonic knowledge bases: propositional case ECAI 1998: 13TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, PROCEEDINGS, 1998, : 47 - 48
- [4] Path Logics for Querying Graphs: Combining Expressiveness and Efficiency 2015 30TH ANNUAL ACM/IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE (LICS), 2015, : 329 - 340
- [6] Temporal factorization vs. spatial factorization COMPUTER VISION - ECCV 2004, PT 2, 2004, 3022 : 434 - 445
- [8] Computational complexity of propositional linear temporal logics based on qualitative spatial or temporal reasoning FRONTIERS OF COMBINING SYSTEMS, 2002, 2309 : 162 - 176
- [10] Model checking vs. generalized model checking: Semantic minimizations for temporal logics LICS 2005: 20TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE - PROCEEDINGS, 2005, : 158 - 167