2022 search results - page 114 / 405 » Complexity of Non-Monotonic Logics |
114
Voted
FSTTCS
2005
Springer
15 years 6 months ago
2005
Springer
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
116
Voted
ICCS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Description Logics (DLs) are a family of class based knowledge representation formalisms characterised by the use of various constructors to build complex classes from si...
109
click to vote
ICCAD
1997
IEEE
15 years 5 months ago
1997
IEEE
In this paper we present an algorithm for converting a BDD representation of a logic function into a multiple-level netlist of disjoint-support subfunctions. On the theoretical si...
106
Voted
AUSAI
2006
Springer
15 years 4 months ago
2006
Springer
In this paper, we generalize our formal approach to modelling PRS agents away from PRS-specific assumptions to more general theories of rationality, while not losing the concretene...
112
Voted
ASE
2004
15 years 20 days ago
2004
In this paper, we develop model checking procedures for three ways of combining (temporal) logics: temporalization, independent combination, and join. We prove that they are termin...