2084 search results - page 202 / 417 » Set Constraints in Logic Programming |
148
click to vote
TCS
2010
15 years 2 months ago
2010
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
147
click to vote
JAR
2000
15 years 4 months ago
2000
We present a formal specification and verification approach for industrial product data bases containing Boolean logic formulae to express constraints. Within this framework, globa...
158
click to vote
IGPL
2011
14 years 7 months ago
2011
We extend the lattice embedding of the axiomatic extensions of the positive fragment of intuitionistic logic into the axiomatic extensions of intuitionistic logic to the setting of...
195
click to vote
SIGMOD
2012
ACM
13 years 6 months ago
2012
ACM
We present BloomUnit, a testing framework for distributed programs written in the Bloom language. BloomUnit allows developers to write declarative test specifications that descri...
141
click to vote
ACL
2010
15 years 2 months ago
2010
We propose a global algorithm for learning entailment relations between predicates. We define a graph structure over predicates that represents entailment relations as directed ed...