{log}: A language for programming in logic with finite sets
From MaRDI portal
Publication:3129506
DOI10.1016/0743-1066(95)00147-6zbMath0874.68056WikidataQ57840361 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
Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini, Adding partial functions to Constraint Logic Programming with sets, Unnamed Item, Unnamed Item, Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*, Constructive negation and constraint logic programming with sets, Set-term unification in a logic database language, Type inference for rank-2 intersection types using set unification, A necessary condition for constructive negation in constraint logic programming, Set graphs. IV. Further connections with claw-freeness, Interval propagation to reason about sets: Definition and implementation of a practical language, Logic programming with infinite sets, A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets, Bounded quantifications for iteration and concurrency in logic programming, Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators, Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership, Set graphs. II. Complexity of set graph recognition and similar problems, Solving quantifier-free first-order constraints over finite sets and binary relations, Automated reasoning with restricted intensional sets, The Bernays-Schönfinkel-Ramsey class for set theory: decidability
Uses Software
