{log}: A language for programming in logic with finite sets
From MaRDI portal
Publication:3129506
Recommendations
Cited in
(35)- Logic programming with infinite sets
- Solving quantifier-free first-order constraints over finite sets and binary relations
- Logic programming with sets
- Set graphs. IV. Further connections with claw-freeness
- scientific article; zbMATH DE number 4009812 (Why is no real title available?)
- scientific article; zbMATH DE number 7552283 (Why is no real title available?)
- Complexity assessments for decidable fragments of set theory. II: A taxonomy for `small' languages involving membership
- Interval propagation to reason about sets: Definition and implementation of a practical language
- scientific article; zbMATH DE number 7552282 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 1630126 (Why is no real title available?)
- scientific article; zbMATH DE number 4016167 (Why is no real title available?)
- Set based logic programming
- scientific article; zbMATH DE number 970726 (Why is no real title available?)
- Vicious circle principle and formation of sets in ASP based languages
- A derived algorithm for evaluating -expressions over abstract sets
- 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
- scientific article; zbMATH DE number 1420800 (Why is no real title available?)
- scientific article; zbMATH DE number 517056 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 1101593 (Why is no real title available?)
- Set-term unification in a logic database language
- ON A THEOREM PROVER FOR VARIATIONAL LOGIC PROGRAMS WITH FUNCTORS SETU AND SETS
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)