{log}: A language for programming in logic with finite sets
From MaRDI portal
Publication:3129506
DOI10.1016/0743-1066(95)00147-6zbMath0874.68056DBLPjournals/jlp/DovierOPR96OpenAlexW2036311242WikidataQ57840361 ScholiaQ57840361MaRDI QIDQ3129506
Agostino Dovier, Enrico Pontelli, Gianfranco Rossi, Eugenio Giovanni Omodeo
Publication date: 10 November 1997
Published in: The Journal of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0743-1066(95)00147-6
Related Items (20)
Bounded quantifications for iteration and concurrency in logic programming ⋮ A necessary condition for constructive negation in constraint logic programming ⋮ The Bernays-Schönfinkel-Ramsey class for set theory: decidability ⋮ Automated reasoning with restricted intensional sets ⋮ Set graphs. IV. Further connections with claw-freeness ⋮ Set-term unification in a logic database language ⋮ Adding partial functions to Constraint Logic Programming with sets ⋮ Type inference for rank-2 intersection types using set unification ⋮ Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership ⋮ Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini ⋮ Interval propagation to reason about sets: Definition and implementation of a practical language ⋮ Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case* ⋮ Set graphs. II. Complexity of set graph recognition and similar problems ⋮ Constructive negation and constraint logic programming with sets ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Solving quantifier-free first-order constraints over finite sets and binary relations ⋮ Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators ⋮ Logic programming with infinite sets ⋮ A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets
Uses Software
This page was built for publication: {log}: A language for programming in logic with finite sets
