Sciweavers

90 search results - page 7 / 18
» Discovering Classes of Strongly Equivalent Logic Programs
Sort
View
ICLP
2007
Springer
14 years 2 months ago
Minimal Logic Programs
aa We consider the problem of obtaining a minimal logic program strongly equivalent (under the stable models semantics) to a given arbitrary propositional theory. We propose a meth...
Pedro Cabalar, David Pearce, Agustín Valver...
TACS
1994
Springer
14 years 19 days ago
An Operational Approach to Combining Classical Set Theory and Functional Programming Languages
Abstract. We have designed a programming logic based on an integration of functional programming languages with classical set theory. The logic merges a classical view of equality ...
Douglas J. Howe, Scott D. Stoller
ASIAN
2006
Springer
140views Algorithms» more  ASIAN 2006»
14 years 9 days ago
On Completeness of Logical Relations for Monadic Types
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
Slawomir Lasota, David Nowak, Yu Zhang
HASKELL
2006
ACM
14 years 2 months ago
Strong types for relational databases
Haskell’s type system with multi-parameter constructor classes and functional dependencies allows static (compile-time) computations to be expressed by logic programming on the ...
Alexandra Silva, Joost Visser
ISMIS
2005
Springer
14 years 2 months ago
Flexible Pattern Discovery with (Extended) Disjunctive Logic Programming
Abstract. The post-genomic era showed up a wide range of new challenging issues for the areas of knowledge discovery and intelligent information management. Among them, the discove...
Luigi Palopoli, Simona E. Rombo, Giorgio Terracina