Circumscription in Data Logic for Data Type Specification

DOI10.1093/LOGCOM/4.1.89zbMATH Open0802.68082OpenAlexW2033769231MaRDI QIDQ4286217

Leopoldo Bertossi

Publication date: 18 December 1994

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/3e9ce889611322c438b410dba236ac3cd0f4f5eb

zbMATH Keywords

first-order logicsecond-order logicnonmonotonic reasoningknowledge basescircumscriptiondata type specification

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Abstract data types; algebraic specification (68Q65) Data structures (68P05) Other applications of logic (03B80)

Recommendations

• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Unnamed Item 👍 👎
• Data types over multiple-valued logics 👍 👎
• Parameter-preserving data type specifications 👍 👎
• A theory for program and data type specification 👍 👎
• Equational logic of circular data type specification 👍 👎
• Program specification and data refinement in type theory 👍 👎
• Data type specification 👍 👎
• Data type inference for logic programming 👍 👎

This page was built for publication: Circumscription in Data Logic for Data Type Specification