Sciweavers

3663 search results - page 110 / 733
» Problems in the ontology of computer programs
Sort
View
ICALP
2005
Springer
15 years 3 months ago
Computational Bounds on Hierarchical Data Processing with Applications to Information Security
Motivated by the study of algorithmic problems in the domain of information security, in this paper, we study the complexity of a new class of computations over a collection of va...
Roberto Tamassia, Nikos Triandopoulos
BIRTHDAY
2003
Springer
15 years 3 months ago
Program Synthesis for Multi-agent Question Answering
Techniques that were developed for program synthesis are being applied to allow multiple agents to communicate with each other and cooperate to solve a single problem. We illustrat...
Richard J. Waldinger, Peter Jarvis, Jennifer L. Du...
EXACT
2008
15 years 7 days ago
Answer Set Programming ? a Domain in Need of Explanation: A Position Paper
This paper describes the problems with debugging tools for answer set programming, a declarative programming paradigm. Current approaches are difficult to use on most applications ...
Martin Brain, Marina De Vos
JAPLL
2010
141views more  JAPLL 2010»
14 years 8 months ago
Algebraic tableau reasoning for the description logic SHOQ
Semantic web applications based on the web ontology language (OWL) often require the use of numbers in class descriptions for expressing cardinality restrictions on properties or ...
Jocelyne Faddoul, Volker Haarslev
CPAIOR
2009
Springer
15 years 4 months ago
Solution Enumeration for Projected Boolean Search Problems
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
Martin Gebser, Benjamin Kaufmann, Torsten Schaub