{log}: A language for programming in logic with finite sets
From MaRDI portal
Publication:3129506
DOI10.1016/0743-1066(95)00147-6zbMATH Open0874.68056DBLPjournals/jlp/DovierOPR96OpenAlexW2036311242WikidataQ57840361 ScholiaQ57840361MaRDI QIDQ3129506FDOQ3129506
Authors: Agostino Dovier, Enrico Pontelli, Gianfranco Rossi, Eugenio 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
Recommendations
Cited In (35)
- Logic programming with infinite sets
- Solving quantifier-free first-order constraints over finite sets and binary relations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Logic programming with sets
- Set graphs. IV. Further connections with claw-freeness
- Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership
- Title not available (Why is that?)
- Interval propagation to reason about sets: Definition and implementation of a practical language
- A set solver for finite set relation algebra
- Predicates as parameters in logic programming: a set-theoretic basis
- A necessary condition for constructive negation in constraint logic programming
- Bounded quantifications for iteration and concurrency in logic programming
- Set graphs. II. Complexity of set graph recognition and similar problems
- Constructive negation and constraint logic programming with sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Set based logic programming
- Vicious circle principle and formation of sets in ASP based languages
- A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets
- Title not available (Why is that?)
- Compilation of set terms in the logic data language (LDL)
- Formative processes with applications to the decision problem in set theory. I: Powerset and singleton operators
- Title not available (Why is that?)
- Complexity assessments for decidable fragments of set theory. I: A taxonomy for the Boolean case
- Adding partial functions to constraint logic programming with sets
- Type inference for rank-2 intersection types using set unification
- The Bernays-Schönfinkel-Ramsey class for set theory: decidability
- Une procédure de décision pour un problème de satisfiabilité dans un univers ensembliste héréditairement fini
- Subset-logic programs and their implementation
- Automated reasoning with restricted intensional sets
- Title not available (Why is that?)
- Set-term unification in a logic database language
- ON A THEOREM PROVER FOR VARIATIONAL LOGIC PROGRAMS WITH FUNCTORS SETU AND SETS
Uses Software
This page was built for publication: {log}: A language for programming in logic with finite sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3129506)
