Sciweavers

6554 search results - page 337 / 1311
» Constraint Logic Programming
Sort
View
AAAI
1996
15 years 8 months ago
Splitting a Default Theory
This paper presents mathematical results that can sometimes be used to simplify the task of reasoning about a default theory, by \splitting it into parts." These so-called Sp...
Hudson Turner
ENTCS
2007
104views more  ENTCS 2007»
15 years 6 months ago
Lazy Context Cloning for Non-Deterministic Graph Rewriting
We define a rewrite strategy for a class of non-confluent constructor-based term graph rewriting systems and discuss its correctness. Our strategy and its extension to narrowing...
Sergio Antoy, Daniel W. Brown, Su-Hui Chiang
IJCAI
1989
15 years 7 months ago
Maximum Entropy in Nilsson's Probabilistic Logic
Nilsson's Probabilistic Logic is a set theoretic mechanism for reasoning with uncertainty. We propose a new way of looking at the probability constraints enforced by the fram...
Thomas B. Kane
LPNMR
2001
Springer
15 years 11 months ago
Multi-dimensional Dynamic Knowledge Representation
Abstract. According to Dynamic Logic Programming (DLP), knowledge may be given by a sequence of theories (encoded as logic programs) representing different states of knowledge. Th...
João Alexandre Leite, José Jú...
ENTCS
2002
90views more  ENTCS 2002»
15 years 6 months ago
A Language for Multi-dimensional Updates
Dynamic Logic Programming (DLP) was introduced to deal with knowledge about changing worlds, by assigning semantics to sequences of generalized logic programs, each of which repres...
João Alexandre Leite, José Jú...