Sciweavers

3724 search results - page 125 / 745
» Timed regular expressions
Sort
View
LPNMR
2001
Springer
15 years 8 months ago
On the Expressibility of Stable Logic Programming
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...
V. Wiktor Marek, Jeffrey B. Remmel
ODBIS
2007
Springer
157views Database» more  ODBIS 2007»
15 years 10 months ago
An Extension of SPARQL for RDFS
Abstract. RDF Schema (RDFS) extends RDF with a schema vocabulary with a predefined semantics. Evaluating queries which involve this vocabulary is challenging, and there is not yet...
Marcelo Arenas, Claudio Gutierrez, Jorge Pé...
LISP
2008
165views more  LISP 2008»
15 years 4 months ago
Adapting functional programs to higher order logic
Higher-order logic proof systems combine functional programming with logic, providing functional programmers with a comfortable setting for the formalization of programs, specifica...
Scott Owens, Konrad Slind
IANDC
2008
116views more  IANDC 2008»
15 years 4 months ago
Deciding expressive description logics in the framework of resolution
We present a decision procedure for the description logic SHIQ based on the basic superposition calculus, and show that it runs in exponential time for unary coding of numbers. To...
Ullrich Hustadt, Boris Motik, Ulrike Sattler
CE
2008
156views more  CE 2008»
15 years 4 months ago
Interactive story authoring: A viable form of creative expression for the classroom
The unprecedented growth in numbers of children playing computer games has stimulated discussion and research regarding what, if any, educational value these games have for teachi...
Mike Carbonaro, Maria Cutumisu, Harvey Duff, Steph...