2035 search results - page 75 / 407 » On the complexity of stratified logics |
164
click to vote
PPDP
2010
Springer
15 years 4 months ago
2010
Springer
Transaction Logic is a logic for representing declarative and procedural knowledge in logic programming, databases, and AI. It has been successful in areas as diverse as workflows...
132
click to vote
EUROPAR
2007
Springer
16 years 10 days 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...
167
click to vote
ICLP
2005
Springer
15 years 11 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...
169
click to vote
ENTCS
2011
15 years 1 months ago
2011
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computation�...
265
click to vote
POPL
2008
ACM
16 years 6 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...