Sciweavers

432 search results - page 24 / 87
» Open answer set programming for the semantic web
Sort
View
LOPSTR
1994
Springer
14 years 2 days ago
More on Unfold/Fold Transformations of Normal Programs: Preservation of Fitting's Semantics
The unfold/fold transformation system defined by Tamaki and Sato was meant for definite programs. It transforms a program into an equivalent one in the sense of both the least tter...
Annalisa Bossi, Sandro Etalle
SEMWEB
2004
Springer
14 years 1 months ago
Dynamic Agent Composition from Semantic Web Services
Abstract. The shift from Web pages to Web services enables programmatic access to the near limitless information on the World Wide Web. Autonomous agents should generate concise an...
Michael Czajkowski, Anna L. Buczak, Martin O. Hofm...
ICSE
2010
IEEE-ACM
13 years 10 months ago
Supporting developers with natural language queries
The feature list of modern IDEs is steadily growing and mastering these tools becomes more and more demanding, especially for novice programmers. Despite their remarkable capabili...
Michael Würsch, Giacomo Ghezzi, Gerald Reif, ...
DLOG
2003
13 years 9 months ago
Incremental Query Answering for Implementing Document Retrieval Services
Agent systems that search the Semantic Web are seen as killer applications for description logic (DL) inference engines. The guiding examples for the Semantic Web involve informat...
Volker Haarslev, Ralf Möller
CORR
2002
Springer
106views Education» more  CORR 2002»
13 years 7 months ago
Domain-Dependent Knowledge in Answer Set Planning
In this paper we consider three di erent kinds of domain dependent control knowledge (temporal, procedural and HTN-based) that are useful in planning. Our approach is declarative ...
Tran Cao Son, Chitta Baral, Tran Hoai Nam, Sheila ...