Sciweavers

756 search results - page 20 / 152
» Using Logic Programs to Reason about Infinite Sets
Sort
View
ICLP
2004
Springer
14 years 1 months ago
Possible Worlds Semantics for Probabilistic Logic Programs
Abstract. In this paper we consider a logic programming framework for reasoning about imprecise probabilities. In particular, we propose a new semantics, for the Probabilistic Logi...
Alex Dekhtyar, Michael I. Dekhtyar
ICDCS
2002
IEEE
14 years 1 months ago
Reasoning about Joint Administration of Access Policies for Coalition Resources
We argue that joint administration of access policies for a dynamic coalition formed by autonomous domains requires that these domains set up a coalition authority that distribute...
Himanshu Khurana, Virgil D. Gligor, John Linn
CADE
2006
Springer
14 years 8 months ago
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
Abstract. Semantic labelling is a transformational technique for proving termination of Term Rewriting Systems (TRSs). Only its variant with finite sets of labels was used so far i...
Adam Koprowski, Hans Zantema
CADE
2005
Springer
14 years 8 months ago
Tabling for Higher-Order Logic Programming
We describe the design and implementation of a higher-order tabled logic programming interpreter where some redundant and infinite computation is eliminated by memoizing sub-comput...
Brigitte Pientka
PPDP
2009
Springer
14 years 3 months ago
Reasoning with hypothetical judgments and open terms in hybrid
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...
Amy P. Felty, Alberto Momigliano