A logic for programming with complex objects

DOI10.1016/0022-0000(93)90021-NMaRDI QIDQ686642zbMATH OpenOpenAlexFDO

Authors Juan-Miguel Gracia

Publication date 10 October 1993

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(93)90021-n

zbMATH Keywords

logic programmingcomplex objectsdeducibe databasesMeier's \(O\)-logicobject identityobject logicobject-oriented databases

Mathematics Subject Classification ID

Artificial intelligence (68T99) Logic programming (68N17) Database theory (68P15) Logic in artificial intelligence (68T27)

Recommendations

• Logical foundations of object-oriented and frame-based languages
• Extended database logic: Complex objects and deduction
• scientific article; zbMATH DE number 549985
• A reasoning mechanism for deductive object-oriented databases
• scientific article; zbMATH DE number 826298

Cites work

• scientific article; zbMATH DE number 4181307 (Why is no real title available?)
• scientific article; zbMATH DE number 3872640 (Why is no real title available?)
• scientific article; zbMATH DE number 4199654 (Why is no real title available?)
• scientific article; zbMATH DE number 4199656 (Why is no real title available?)
• scientific article; zbMATH DE number 3467028 (Why is no real title available?)
• scientific article; zbMATH DE number 4185011 (Why is no real title available?)
• A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness
• A logic for reasoning with inconsistency
• An improvement on Valiant's decision procedure for equivalence of deterministic finite turn pushdown machines
• Extended algebra and calculus for nested relational databases
• Logical foundations of object-oriented and frame-based languages
• Login: a logic programming language with built-in inheritance
• Object identity as a query language primitive
• On first-order-logic databases
• The Specialization of Programs by Theorem Proving
• Why not negation by fixpoint?
• `` Strong NP-Completeness Results

Cited in

(13)

• On the expressive power of F-logic language
• scientific article; zbMATH DE number 826298 (Why is no real title available?)
• Extended database logic: Complex objects and deduction
• MGS: a rule-based programming language for complex objects and collections
• Categorial graphs
• scientific article; zbMATH DE number 6991660 (Why is no real title available?)
• The expressive power of cardinality-bounded set values in object-based data models
• A semideterministic approach to object creation and nondeterminism in database queries
• A logical framework for deductive objects
• scientific article; zbMATH DE number 1945864 (Why is no real title available?)
• The expressive power of stratified logic programs with value invention
• scientific article; zbMATH DE number 107704 (Why is no real title available?)
• scientific article; zbMATH DE number 549985 (Why is no real title available?)

This page was built for publication: A logic for programming with complex objects

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