Non-conservative extension of a peer in a P2P inference system

DOI10.3233/AIC-2009-0452MaRDI QIDQ3400892zbMATH OpenOpenAlexFDO

Authors Nada Abdallah, François Goasdoué

Publication date 27 January 2010

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/aic-2009-0452

zbMATH Keywords

propositional logicdecentralized algorithmsconsequence findingconservative extension checking

Mathematics Subject Classification ID

Theory of languages and software systems (knowledge-based systems, expert systems, etc.) for artificial intelligence (68T35) Database theory (68P15) Network design and communication in computer systems (68M10) General topics in artificial intelligence (68T01)

Recommendations

• Distributed reasoning in a peer-to-peer setting: application to the semantic web
• A logic framework for P2P deductive databases
• Database Programming Languages
• Consistency and trust in peer data exchange systems
• Intensional Semantics for P2P Data Integration

Cited in

(1)

• Distributed reasoning in a peer-to-peer setting: application to the semantic web

This page was built for publication: Non-conservative extension of a peer in a P2P inference system

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