Sciweavers

756 search results - page 8 / 152
» Using Logic Programs to Reason about Infinite Sets
Sort
View
ECSQARU
2001
Springer
14 years 27 days ago
Reasoning about Knowledge Using Rough Sets
Abstract. In this paper, we first investigate set semantics of propositional logic in terms of rough sets and discuss how truth values of propositions (sentences) can be interpret...
Weiru Liu
PODS
2008
ACM
158views Database» more  PODS 2008»
14 years 8 months ago
Local Hoare reasoning about DOM
The W3C Document Object Model (DOM) specifies an XML update library. DOM is written in English, and is therefore not compositional and not complete. We provide a first step toward...
Philippa Gardner, Gareth Smith, Mark J. Wheelhouse...
POPL
2008
ACM
14 years 8 months ago
Cyclic proofs of program termination in separation logic
We propose a novel approach to proving the termination of heapmanipulating programs, which combines separation logic with cyclic proof within a Hoare-style proof system. Judgement...
James Brotherston, Richard Bornat, Cristiano Calca...
DLOG
2008
13 years 10 months ago
Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...
Andrea Calì, Georg Gottlob, Michael Kifer
AIR
2004
106views more  AIR 2004»
13 years 8 months ago
Web-Based Adaptive Tutoring: An Approach Based on Logic Agents and Reasoning about Actions
In this paper we describe an approach to the construction of adaptive tutoring systems, based on techniques from the research area of Reasoning about Actions and Change. This appro...
Matteo Baldoni, Cristina Baroglio, Viviana Patti