Declarative Semantics for P2P Data Management System

Abiteboul S, Hull R, Vianu V (1995) Foundations of databases. Addison-Wesley, Boston

Arenas M, Bertossi L, Chomicki J (1999) Consistent query answers in inconsistent databases. In: PODS, pp 68–79

Bertossi L, Bravo L (2004) Query answering in peer-to-peer data exchange systems. In: Extending database technology workshops

Bertossi L, Bravo L (2007) The semantics of consistency and trust in peer data exchange systems. In: LPAR, pp 107–122

Bertossi L, Bravo L (2017) Consistency and trust in peer data exchange systems. TPLP 17(2):148–204

Bikakis A, Antoniou G (2008) Distributed defeasible contextual reasoning in ambient computing. In: European conference on ambient intelligence. Springer, Berlin, pp 308–325.

Brewka G, Eiter T (1999) Preferred answer sets for extended logic programs. Artif Intell 109(1–2):297–356

Brewka G, Eiter T (2007) Equilibria in heterogeneous nonmonotonic multi-context systems. In: AAAI, pp 385–390

Brewka G, Niemela I, Truszczynski M (2003) Answer set optimization. In: IJCAI, pp 867–872

Brewka G (2002) Logic programming with ordered disjunction. In: AAAI/IAAI, pp 100–105

Brewka G, Niemela I, Truszczynski M (2003) Answer set optimization. In: IJCAI

Buccafurri F, Leone N, Rullo P (2000) Enhancing disjunctive datalog by constraints. TKDE 12(5):845–860

Calvanese D, De Giacomo G, Lembo D, Lenzerini M, Rosati R (2007) Inconsistency tolerance in P2P data integration: an epistemic logic approach. In: International Workshop on Database Programming Languages. Springer, Berlin, pp 90-105.

Calvanese D, De Giacomo G, Lenzerini M, Rosati R (2004) Logical foundations of peer-to-peer data integration. In: PODS, pp 241–251

Caroprese L, Greco S, Zumpano E (2006) A logic programming approach to querying and integrating P2P deductive databases. In: FLAIRS, pp 31–36

Caroprese L, Molinaro C, Zumpano E (2006) Integrating and querying P2P deductive databases. In: IDEAS, pp 285–290

Caroprese L, Zumpano E (2007) Consistent data integration in P2P deductive. In: SUM, pp 230–243

Caroprese L, Zumpano E (2008) Modeling cooperation in P2P data management systems. In: ISMIS, pp 225–235

Caroprese L, Zumpano E (2012) Handling preferences in P2P systems. In: FOIKS, pp 91–106

Caroprese L, Zumpano E (2017) P2P Deductive databases: well founded semantics and distributed computation. In: ADBIS, pp 91–99

Caroprese L, Zumpano E. P2P deductive databases: a system prototype. In: iiWAS 2017, pp 258–265

Caroprese L, Zumpano E (2000) A logic framework for P2P deductive databases. Theory Pract Log Program 20(1):1–43

Delgrande JP, Schaub T, Tompits H (2000) Logic programs with compiled preferences. In: ECAI, pp 464–468

Delgrande JP, Schaub T, Tompits H (2003) A framework for compiling preferences in logic programs. TPLP 3(2):129–187

Franconi E, Kuper GM, Lopatenko A, Zaihrayeu I (2004) Queries and updates in the coDB peer to peer database system. In: VLDB, pp 1277–1280

Franconi E, Kuper GM, Lopatenko A, Zaihrayeu I (2003) A robust logical and computational characterisation of Peer-to-Peer database systems. In: DBISP2P, pp 64–76

Franconi E, Kuper GM, Lopatenko A, Zaihrayeu I (2004) A distributed algorithm for robust data sharing and updates in P2P database networks. In: EDBT Workshops, pp 446–455

Gelder AV (1989) The Alternating Fixpoint of Logic Programs with Negation. In: PODS, pp 1–10

Gelfond M, Lifschitz V (1988) The Stable Model Semantics for Logic Programming. In: ICLP/SLP, pp 1070–1080

Gelfond M, Son TC (1997) Reasoning with prioritized defaults. In: LPKR pp 164–223

Greco S (1999) Dynamic programming in datalog with aggregates. IEEE Trans. Knowl. Data Eng. 11(2):265–283

Greco S, Greco G, Zumpano E (2003) Repairing and querying inconsistent databases. TKDE 15(6):1389–1408

Halevy AY, Zachary GI, Suciu D, Tatarinov I (2003) Schema mediation in peer data management systems. In: ICDE, pp 505–516

Lenzerini M (2002) Data integration: a theoretical perspective. In: PODS, pp 233–246

Leone N, Pfeifer G, Faber W, Eiter T, Gottlob G, Perri S, Scarcello F (2006) The DLV system for knowledge representation and reasoning. ACM Trans. Comput. Log. 7(3):499–562

Lloyd JW (1987) Foundations of logic programming. Springer, Berlin

Lonc L, Truszczynski M (2000) On the Problem of Computing the Well-Founded Semantics. In: International conference on computational logic. Springer, Berlin, pp 673-687

Papadimitriou CH (1994) Computational complexity. Addison-Wesley, ISBN 978-0-201-53082-7, pp. I-XV, 1-523

Sakama C, Inoue K (2000) Prioritized logic programming and its application to commonsense reasoning. Artif Intell 123(1–2):185–222

Sakama C, Inoue K (1996) Representing priorities in logic programs. In: JICSLP, pp 82–96

Schaub T, Wang K (2001) A comparative study of logic programs with preference. In: IJCAI, pp 597–602

Syrjanen T, Niemela I (2001) The smodels system. In: LPNMR, pp 434–438

Wakaki T, Inoue K, Sakama C, Nitta K (2003) Computing preferred answer sets in answer set programming. In: LPAR conference, pp 259–273

Wang K, Zhou L, Lin F (2000) Alternating Fixpoint Theory for Logic Programs with Priority. In: International conference on computational logic. Springer, Berlin, pp 164-178.

Yang B, Garcia-Molina H (2003) Designing a super-peer network. In: ICDE

Zhang Y, Foo N (1997) Answer sets for prioritized logic programs. In: ILPS, pp 69–83