Sciweavers

1137 search results - page 159 / 228
» Knowledge Representation with Logic Programs
Sort
View
ICLP
2005
Springer
14 years 1 months ago
Techniques for Scaling Up Analyses Based on Pre-interpretations
Any finite tree automaton (or regular type) can be used to construct act interpretation of a logic program, by first determinising and completing the automaton to get a pre-inter...
John P. Gallagher, Kim S. Henriksen, Gourinath Ban...
WWW
2004
ACM
14 years 8 months ago
Interpreting distributed ontologies
Semantic Web is challenged by the URI meaning issues arising from putting ontologies in open and distributed environments. As a try to clarify some of the meaning issues, this pap...
Yuzhong Qu, Zhiqiang Gao
AIIA
1991
Springer
13 years 11 months ago
Approximate Entailment
The use of approximation as a method for dealing with complex problems is a fundamental research issue in Knowledge Representation. Using approximation in symbolic AI is not strai...
Marco Cadoli, Marco Schaerf
WWW
2007
ACM
14 years 8 months ago
Analyzing web access control policies
XACML has emerged as a popular access control language on the Web, but because of its rich expressiveness, it has proved difficult to analyze in an automated fashion. In this pape...
Vladimir Kolovski, James A. Hendler, Bijan Parsia
ATAL
2006
Springer
13 years 11 months ago
Temporal qualitative coalitional games
Qualitative Coalitional Games (QCGs) are a version of coalitional games in which an agent's desires are represented as goals which are either satisfied or unsatisfied, and ea...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...