Sciweavers

2473 search results - page 340 / 495
» The Logic of Communication Graphs
Sort
View
199
Voted
ASP
2005
Springer
16 years 16 days ago
Intelligence Analysis Using Quantitative Preferences
The extended answer set semantics for simple logic programs, i.e. programs with only classical negation, allows for the defeat of rules to resolve contradictions. In addition, a pa...
Davy Van Nieuwenborgh, Stijn Heymans, Dirk Vermeir
214
Voted
PPSWR
2005
Springer
16 years 14 days ago
A Geospatial World Model for the Semantic Web
The Semantic Web is an endeavour aiming at enhancing Web data with meta-data and data processing, as well as processing methods specifying the “meaning” of such data and allowi...
François Bry, Bernhard Lorenz, Hans Jü...
PLDI
2004
ACM
16 years 13 days ago
The set constraint/CFL reachability connection in practice
Many program analyses can be reduced to graph reachability problems involving a limited form of context-free language reachability called Dyck-CFL reachability. We show a new redu...
John Kodumal, Alexander Aiken
221
Voted
CSCLP
2004
Springer
16 years 12 days ago
Automatically Exploiting Symmetries in Constraint Programming
We introduce a framework for studying and solving a class of CSP formulations. The framework allows constraints to be expressed as linear and nonlinear equations, then compiles th...
Arathi Ramani, Igor L. Markov
188
Voted
ITS
2004
Springer
130views Multimedia» more  ITS 2004»
16 years 11 days ago
Opening the Door to Non-programmers: Authoring Intelligent Tutor Behavior by Demonstration
Abstract. Intelligent tutoring systems are quite difficult and time intensive to develop. In this paper, we describe a method and set of software tools that ease the process of cog...
Kenneth R. Koedinger, Vincent Aleven, Neil T. Heff...