Sciweavers

590 search results - page 13 / 118
» From Relational Specifications to Logic Programs
Sort
View
FUIN
2008
136views more  FUIN 2008»
13 years 7 months ago
Multi-Dimensional Relational Sequence Mining
The issue addressed in this paper concerns the discovery of frequent multi-dimensional patterns from relational sequences. The great variety of applications of sequential pattern m...
Floriana Esposito, Nicola Di Mauro, Teresa Maria A...
SIGSOFT
2005
ACM
14 years 8 months ago
Relational analysis of algebraic datatypes
We present a technique that enables the use of finite model finding to check the satisfiability of certain formulas whose intended models are infinite. Such formulas arise when us...
Viktor Kuncak, Daniel Jackson
AAAI
2004
13 years 9 months ago
SAT-Based Answer Set Programming
The relation between answer set programming (ASP) and propositional satisfiability (SAT) is at the center of many research papers, partly because of the tremendous performance boo...
Enrico Giunchiglia, Yuliya Lierler, Marco Maratea
ESOP
2006
Springer
13 years 11 months ago
Step-Indexed Syntactic Logical Relations for Recursive and Quantified Types
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...
Amal J. Ahmed
CLIMA
2004
13 years 9 months ago
Dynamic Logic Programming: Various Semantics Are Equal on Acyclic Programs
Abstract. Multidimensional dynamic logic programs (MDLPs) are suitable to represent knowledge dynamic in time, or more generally, information coming from various sources, partially...
Martin Homola