Sciweavers

427 search results - page 3 / 86
» Inductive reasoning about effectful data types
Sort
View
CADE
1998
Springer
13 years 11 months ago
Admissibility of Fixpoint Induction over Partial Types
Partial types allow the reasoning about partial functions in type theory. The partial functions of main interest are recursively computed functions, which are commonly assigned ty...
Karl Crary
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
14 years 7 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
KR
1992
Springer
13 years 11 months ago
Reasoning About Indefinite Actions
In this paper, we view planning as a special case of reasoning about indefinite actions. We treat actions as predicates defined over a linear temporal order. This formalism permit...
L. Thorne McCarty, Ron van der Meyden
TPHOL
2009
IEEE
14 years 2 months ago
A Brief Overview of Agda - A Functional Language with Dependent Types
Abstract. We give an overview of Agda, the latest in a series of dependently typed programming languages developed in Gothenburg. Agda is based on Martin-L¨of’s intuitionistic t...
Ana Bove, Peter Dybjer, Ulf Norell
SEBD
2003
159views Database» more  SEBD 2003»
13 years 8 months ago
Spatial Tree Logics to reason about Semistructured Data
The Ambient Logic is a modal logic proposed to describe the structural and computational properties of distributed and mobile computations. The static part of the Ambient Logic is,...
Giovanni Conforti, Giorgio Ghelli