Sciweavers

272 search results - page 18 / 55
» Programming languages capturing complexity classes
Sort
View
106
Voted
LICS
2009
IEEE
15 years 7 months ago
Pointer Programs and Undirected Reachability
Pointer programs are a model of structured computation within logspace. They capture the common description of logspace algorithms as programs that take as input some structured d...
Martin Hofmann, Ulrich Schöpp
94
Voted
IFIP
1998
Springer
15 years 5 months ago
Modeling of Hypermedia Applications with HyDev
This paper introduces the HyDev approach to structured and systematic development of typical hypermedia applications. HyDev focuses on the early phases of the development process, ...
Peter Pauen, Josef Voss, Hans-Werner Six
ICLP
2005
Springer
15 years 6 months ago
OWL: A Description Logic Based Ontology Language
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...
Ian Horrocks
98
Voted
ICFP
2006
ACM
16 years 21 days ago
Type-theoretic design patterns
The development of design patterns in object-oriented programming aims at capturing good software design in a re-usable generic form. However, design patterns are not expressible ...
Ondrej Rypacek, Roland Carl Backhouse, Henrik Nils...
121
Voted
FOCS
1998
IEEE
15 years 5 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello