Cardinality constraints in disjunctive deductive databases

DOI10.1007/3-540-36596-6_10MaRDI QIDQ4413450zbMATH OpenFDO

Authors Dietmar Seipel, Ulrich Geske

Publication date 20 July 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2582/25820179.htm

zbMATH Keywords

cardinality constraintsconstraint logic programmingdisjunctive logic programminghyperresolution

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15)

Recommendations

• Cardinality Restrictions Within Description Logic Connection Calculi
• Theory and algorithms for disjunctive deductive databases
• Cardinality constraints in semantic data models
• Logical constraints as cardinality rules: Tight representation
• Applying restriction constraints to deductive databases
• Paraconsistent disjunctive deductive databases
• Detecting cardinality constraints in CNF
• Logics in Artificial Intelligence
• scientific article; zbMATH DE number 53282

Cited in

(7)

• Tight representation of logical constraints as cardinality rules
• On the implication problem for cardinality constraints and functional dependencies
• scientific article; zbMATH DE number 4064539 (Why is no real title available?)
• scientific article; zbMATH DE number 2080035 (Why is no real title available?)
• Logics in Artificial Intelligence
• Combination of Among and Cardinality Constraints
• The expressive power of cardinality-bounded set values in object-based data models

Describes a project that uses

Uses Software

• Smodels

This page was built for publication: Cardinality constraints in disjunctive deductive databases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4413450)