2022 search results - page 83 / 405 » Complexity of Non-Monotonic Logics |
86
Voted
EUROPAR
2007
Springer
15 years 6 months ago
2007
Springer
We present in detail a GCA (Global Cellular Automaton) algorithm with 3n cells for Hirschberg’s algorithm which determines the connected components of a n-node undirected graph w...
112
click to vote
ICLP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
192
Voted
POPL
2008
ACM
16 years 1 months ago
2008
ACM
Okasaki and others have demonstrated how purely functional data structures that are efficient even in the presence of persistence can be constructed. To achieve good time bounds e...
97
Voted
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
115
click to vote
PODS
2008
ACM
16 years 25 days ago
2008
ACM
We introduce a theoretical framework for discovering relationships between two database instances over distinct and unknown schemata. This framework is grounded in the context of ...