Finding Explanations of Inconsistency in Multi-Context Systems

Size: px
Start display at page:

Download "Finding Explanations of Inconsistency in Multi-Context Systems"

Transcription

1 Finding Explanations of Inconsistency in Multi-Context Systems Thomas Eiter Michael Fink Peter Schüller Antonius Weinzierl Principles of Knowledge Representation and Reasoning May 10, 2010 Vienna University of Technology Institute for Information Systems Knowledge-Based Systems Group Supported by the Vienna Science and Technology Fund (WWTF) under grant ICT08-020

2 Motivation Interlinking and Integrating Knowledge Focus on decentralized systems Heterogeneous and nonmonotonic system parts, here called contexts (databases, ontologies, answer set programs,... ) Fixed (small) amount of contexts Fixed topology Example: companies linking their business logics unifying formalism: Multi-Context Systems 1 / 20

3 Motivation Interlinking and Integrating Knowledge Focus on decentralized systems Heterogeneous and nonmonotonic system parts, here called contexts (databases, ontologies, answer set programs,... ) Fixed (small) amount of contexts Fixed topology Example: companies linking their business logics unifying formalism: Multi-Context Systems Inconsistencies arise easily, even if all contexts are consistent: Unforseen effects of information exchange Complexity of application and data We seek to understand and give reasons for inconsistencies. 1 / 20

4 Multi-Context Systems MCSs introduced by [Giunchiglia & Serafini, 1994]: represent inter-contextual information flow express reasoning w.r.t. contextual information allow decentralized, pointwise information exchange Framework extended for integrating heterogeneous non-monotonic logics [Brewka & Eiter, 2007]. 2 / 20

5 Syntax and Semantics of MCSs (1) What is a multi-context system? a collection M = (C 1,..., C n ) of contexts What is a context? Ci = (L i, kb i, br i ) L i : a logic kb i : the context s knowledge base br i : a set of bridge rules 3 / 20

6 Syntax and Semantics of MCSs (1) What is a multi-context system? a collection M = (C 1,..., C n ) of contexts What is a context? Ci = (L i, kb i, br i ) L i : a logic kb i : the context s knowledge base br i : a set of bridge rules What is a logic? L = (KBL, BS L, ACC L ) KBL : set of well-formed knowledge bases BS L : is the set of possible belief sets ACC L : KB L 2 BSL : acceptability function: Which belief sets are accepted by a knowledge base? 3 / 20

7 Syntax and Semantics of MCSs (2) M = (C 1,..., C n ) C i = (L i, kb i, br i ) L = (KB L, BS L, ACC L ) What is a belief state? S i BS Li is a belief set at C i S = (S 1,..., S n ) is a belief state of M 4 / 20

8 Syntax and Semantics of MCSs (2) M = (C 1,..., C n ) C i = (L i, kb i, br i ) L = (KB L, BS L, ACC L ) What is a belief state? S i BS Li is a belief set at C i S = (S 1,..., S n ) is a belief state of M What is a bridge rule? (k : s) (c 1 : p 1 ),..., (c j : p j ), not (c j+1 : p j+1 ),..., not (c m : p m ). Given a bridge rule r, intuitively (c : p) looks at presence of belief p at context C c (belief set S c )... r is applicable if positive p i are present and negative p i are absent... applicable s is added to knowledge base of context k 4 / 20

9 Syntax and Semantics of MCSs (3) Equilibrium semantics: A belief state S = (S 1,..., S n )... makes certain bridge rules applicable,... so we can add their heads to the kb i of the contexts. imported beliefs = bridge rule heads C 1 C 2 accepted beliefs = belief sets 5 / 20

10 Syntax and Semantics of MCSs (3) Equilibrium semantics: A belief state S = (S 1,..., S n )... makes certain bridge rules applicable,... so we can add their heads to the kb i of the contexts. C 1 C 2 5 / 20

11 Syntax and Semantics of MCSs (3) Equilibrium semantics: A belief state S = (S 1,..., S n )... makes certain bridge rules applicable,... so we can add their heads to the kb i of the contexts. S is an equilibrium iff each context plus these heads accepts S i. Equilibrium condition: S i ACC(kb i H i ) for all C i a c kb 1 kb 2 {a, c} 5 / 20

12 Example - Contexts Health care decision support system (wrt. medication and pneumonia): patient history database C 1, blood and X-Ray analysis database C 2, ontology of diseases C 3 (description logic), expert system C 4 (disjunctive logic program). C 1 = {allergy_strong_ab} C 2 = { blood_marker, xray_pneumonia} C 3 = {Pneumonia Marker AtypPneumonia} C 4 = {give_strong give_weak need_ab. give_strong need_strong. give_strong, not allow_strong_ab. give_nothing not need_ab, not need_strong.} 6 / 20

13 Example - Bridge Rules r 1 = (3 : Pneumonia(p)) (2 : xray_pneumonia). r 2 = (3 : Marker(p)) (2 : blood_marker). r 3 = (4 : need_ab) (3 : Pneumonia(p)). r 4 = (4 : need_strong) (3 : AtypPneumonia(p)). r 5 = (4 : allow_strong_ab) not (1 : allergy_strong_ab). C 1 History r 5 r 3 r 2 Laboratory r 1 C 2 Expert System Disease Ontology C 4 r 4 S = ({allergy_strong_ab}, { blood_marker, xray_pneumonia}, C 3 7 / 20

14 Example - Bridge Rules r 1 = (3 : Pneumonia(p)) (2 : xray_pneumonia). r 2 = (3 : Marker(p)) (2 : blood_marker). r 3 = (4 : need_ab) (3 : Pneumonia(p)). r 4 = (4 : need_strong) (3 : AtypPneumonia(p)). r 5 = (4 : allow_strong_ab) not (1 : allergy_strong_ab). C 1 History r 5 r 3 r 2 Laboratory r 1 C 2 C 4 Expert System r 4 Disease Ontology S = ({allergy_strong_ab}, { blood_marker, xray_pneumonia}, {Pneumonia(p)}, C 3 7 / 20

15 Example - Bridge Rules r 1 = (3 : Pneumonia(p)) (2 : xray_pneumonia). r 2 = (3 : Marker(p)) (2 : blood_marker). r 3 = (4 : need_ab) (3 : Pneumonia(p)). r 4 = (4 : need_strong) (3 : AtypPneumonia(p)). r 5 = (4 : allow_strong_ab) not (1 : allergy_strong_ab). C 1 History r 5 r 3 r 2 Laboratory r 1 C 2 C 4 Expert System r 4 Disease Ontology S = ({allergy_strong_ab}, { blood_marker, xray_pneumonia}, {Pneumonia(p)}, {need_ab, C 3 7 / 20

16 Example - Bridge Rules r 1 = (3 : Pneumonia(p)) (2 : xray_pneumonia). r 2 = (3 : Marker(p)) (2 : blood_marker). r 3 = (4 : need_ab) (3 : Pneumonia(p)). r 4 = (4 : need_strong) (3 : AtypPneumonia(p)). r 5 = (4 : allow_strong_ab) not (1 : allergy_strong_ab). C 1 History r 5 r 3 r 2 Laboratory r 1 C 2 C 4 Expert System r 4 Disease Ontology S = ({allergy_strong_ab}, { blood_marker, xray_pneumonia}, {Pneumonia(p)}, {need_ab,give_weak}) is an equilibrium. C 3 7 / 20

17 Inconsistency Analysis Inconsistency is the lack of an equilibrium. We seek to understand and give reasons for inconsistencies. We use ideas from model-based diagnosis [Reiter 1987] Assumptions: Contexts without input are consistent Bridge rules characterize reasons for inconsistency 8 / 20

18 Inconsistency Analysis Inconsistency is the lack of an equilibrium. We seek to understand and give reasons for inconsistencies. We use ideas from model-based diagnosis [Reiter 1987] Assumptions: Rationale: Contexts without input are consistent Bridge rules characterize reasons for inconsistency Context internals are abstracted away not our business Information flow can have unforeseen effects. Knowledge integration between companies: changing company knowledge bases (often) impossible 8 / 20

19 Diagnoses and Explanations Explaining inconsistency: Consistency-based Diagnosis : Which bridge rules need to be changed to get an equilibrium? changed by removing the rule, or changed by adding the rule in its unconditional form identifies some rules as "faulty" (causing inconsistency) provides possible repairs 9 / 20

20 Diagnoses and Explanations Explaining inconsistency: Consistency-based Diagnosis : Which bridge rules need to be changed to get an equilibrium? changed by removing the rule, or changed by adding the rule in its unconditional form identifies some rules as "faulty" (causing inconsistency) provides possible repairs Entailment-based Inconsistency Explanation : Which bridge rules are required for inconsistency? required, assuming all other rules are removed from the MCS finds groups of rules which together cause inconsistency allows to separate inconsistencies (if there are several of them) 9 / 20

21 Diagnosis Diagnosis: remove rules, or add them unconditionally, to get consistency Definition A diagnosis is a pair (D 1, D 2 ), D 1, D 2 br M, such that M[br M \ D 1 heads(d 2 )] = Notation: br M bridge rules of MCS M M[R] MCS M with bridge rules R instead of br M M = MCS M is inconsistent heads(r) rules in R in unconditional form (α for α β) 10 / 20

22 Diagnosis Diagnosis: remove rules, or add them unconditionally, to get consistency Definition A diagnosis is a pair (D 1, D 2 ), D 1, D 2 br M, such that M[br M \ D 1 heads(d 2 )] = Notation: br M bridge rules of MCS M M[R] MCS M with bridge rules R instead of br M M = MCS M is inconsistent heads(r) rules in R in unconditional form (α for α β) D ± (M): set of diagnoses of M D ± m(m) D ± (M): set of pointwise -minimal diagnoses of M 10 / 20

23 Example - Diagnoses Assume C 2 = {blood_marker, xray_pneumonia} No equilibrium 11 / 20

24 Example - Diagnoses Assume C 2 = {blood_marker, xray_pneumonia} No equilibrium Minimal diagnoses: ({r 1 }, ), remove r 1 : (3 : Pneumonia(p)) (2 : xray_pneumonia). S 3 = {Marker(p)}, S 4 = {give_nothing} 11 / 20

25 Example - Diagnoses Assume C 2 = {blood_marker, xray_pneumonia} No equilibrium Minimal diagnoses: ({r 1 }, ), ({r 2 }, ), remove r 1 : (3 : Pneumonia(p)) (2 : xray_pneumonia). S 3 = {Marker(p)}, S 4 = {give_nothing} remove r 2 : (3 : Marker(p)) (2 : blood_marker). S 3 = {Pneumonia(p)}, S 4 = {need_ab, give_weak} 11 / 20

26 Example - Diagnoses Assume C 2 = {blood_marker, xray_pneumonia} No equilibrium Minimal diagnoses: ({r 1 }, ), ({r 2 }, ), ({r 4 }, ), remove r 1 : (3 : Pneumonia(p)) (2 : xray_pneumonia). S 3 = {Marker(p)}, S 4 = {give_nothing} remove r 2 : (3 : Marker(p)) (2 : blood_marker). S 3 = {Pneumonia(p)}, S 4 = {need_ab, give_weak} remove r 4 : (4 : need_strong) (3 : AtypPneumonia(p)). S 3 = {Pneumonia(p), Marker(p), AtypPneumonia(p)} S 4 = {need_ab, give_weak} 11 / 20

27 Example - Diagnoses Assume C 2 = {blood_marker, xray_pneumonia} No equilibrium Minimal diagnoses: ({r 1 }, ), ({r 2 }, ), ({r 4 }, ), and (, {r 5 }). remove r 1 : (3 : Pneumonia(p)) (2 : xray_pneumonia). S 3 = {Marker(p)}, S 4 = {give_nothing} remove r 2 : (3 : Marker(p)) (2 : blood_marker). S 3 = {Pneumonia(p)}, S 4 = {need_ab, give_weak} remove r 4 : (4 : need_strong) (3 : AtypPneumonia(p)). S 3 = {Pneumonia(p), Marker(p), AtypPneumonia(p)} S 4 = {need_ab, give_weak} add r 5 : (4 : allow_strong_ab) not (1 : allergy_strong_ab). S 3 = {Pneumonia(p), Marker(p), AtypPneumonia(p)} S 4 = {need_ab, need_strong, allow_strong_ab, give_strong} 11 / 20

28 Inconsistency Explanation Inconsistency Explanation: rules (heads) that must be present (absent) for inconsistency Definition An inconsistency explanation is a pair (E 1, E 2 ), E 1, E 2 br M, such that for each pair (R 1, R 2 ), E 1 R 1 br M, R 2 br M \ E 2 M[R 1 heads(r 2 )] = E ± (M) (E ± m (M)): sets of ( -minimal) inconsistency explanations in M 12 / 20

29 Inconsistency Explanation Inconsistency Explanation: rules (heads) that must be present (absent) for inconsistency Definition An inconsistency explanation is a pair (E 1, E 2 ), E 1, E 2 br M, such that for each pair (R 1, R 2 ), E 1 R 1 br M, R 2 br M \ E 2 M[R 1 heads(r 2 )] = E ± (M) (E ± m (M)): sets of ( -minimal) inconsistency explanations in M Intuition: rules in E 1 create inconsistency all supersets inconsistent inconsistency is relevant in M adding rules from E 2 unconditionally is necessary to restore consistency related to minimal inconsistent sets 12 / 20

30 Example - Inconsistency Explanations Assume C 2 = {blood_marker, xray_pneumonia} (as before) Minimal inconsistency explanation: ({r 1, r 2, r 4 }, {r 5 }). 13 / 20

31 Example - Inconsistency Explanations Assume C 2 = {blood_marker, xray_pneumonia} (as before) Minimal inconsistency explanation: ({r 1, r 2, r 4 }, {r 5 }). Minimal diagnoses: ({r 1 }, ), ({r 2 }, ), ({r 4 }, ), and (, {r 5 }). 13 / 20

32 Duality Assume C 2 = {blood_marker, xray_pneumonia} (as before) Minimal inconsistency explanation: ({r 1, r 2, r 4 }, {r 5 }). Minimal diagnoses: ({r 1 }, ), ({r 2 }, ), ({r 4 }, ), and (, {r 5 }). Theorem For an inconsistent MCS, the unions of all minimal diagnoses D ± m minimal inconsistency explanations E m ± coincide: D ± m (M) = E m ± (M) and all Notation: X = ( {A (A, B) X}, {B (A, B) X} ) for X a set of (A, B) Diagnoses and explanations identify the same bridge rules 13 / 20

33 Context Complexity recall: equilibrium condition S i ACC(kb i H i ) for all C i Output beliefs OUT i : beliefs in bridge rule body literals 14 / 20

34 Context Complexity recall: equilibrium condition S i ACC(kb i H i ) for all C i Output beliefs OUT i : beliefs in bridge rule body literals bridge rules depend on output projected belief sets S i = S i OUT i Context complexity = equilibrium existence condition: S i ACC i(kb i H i ) OUTi 14 / 20

35 Complexity: Inconsistency Analysis Problem: recognition of diagnosis/explanation Input: candidate (D 1, D 2 ) resp. (E 1, E 2 ) and M 15 / 20

36 Complexity: Inconsistency Analysis Problem: recognition of diagnosis/explanation Input: candidate (D 1, D 2 ) resp. (E 1, E 2 ) and M Complexity Results (Completeness): context (D 1, D 2 )? (E 1, E 2 )? complexity D ± (M) D ± m(m) E ± (M) E m ± (M) P NP D P conp D P NP NP D P conp D P Σ P 2 Σ P 2 D P 2 Π P 2 D P 2 PSPACE EXPTIME PSPACE EXPTIME D P : solve both an NP and an independent conp problem 15 / 20

37 D ± Computation using HEX-programs HEX = ASP + Higher order features + external atoms Guess diagnosis Guess output belief state a i atoms Evaluate bridge rules b i atoms Check if output belief state is an output projected equilibrium: equilibrium condition: S i ACC i(kb i H i ) OUTi HEX constraint: not &con_out i [a i, b i ](). Open source implementation is available: 16 / 20

38 Special Cases and Properties Special Cases: s-diagnoses: Which rules must be removed to restore consistency? s-inconsistency Explanations: Which rules must be present to get inconsistency? duality holds Splitting Sets on MCS contexts modularity properties Preference orders which are different from subset-minimality: duality for certain Ceteris Paribus preference orderings 17 / 20

39 Explaining Inconsistency Conclusions We analyze inconsistencies to know "what s going on". Our approach... uses inconsistency to gain information provides possible repairs via diagnoses allows to separate sources of inconsistency via explanations 18 / 20

40 Explaining Inconsistency Conclusions We analyze inconsistencies to know "what s going on". Our approach... uses inconsistency to gain information provides possible repairs via diagnoses allows to separate sources of inconsistency via explanations We aim at configurable inconsistency management: automatic repair may be dangerous (see our example) automatic repair may be useful in other cases diagnoses and explanations form a basis for inconsistency management 18 / 20

41 Current and Future Work Current and Future work aims at... query answers on inconsistent MCSs e.g., defining partial equilibria e.g., defining brave and cautious query answers a local point of view to evaluation distributed algorithms approaches to compare diagnoses/explanations quantitative approaches inconsistency measures qualitative approaches using world knowledge implementations and benchmarks relevant application scenarios distributed implementation 19 / 20

Preference-based Inconsistency Assessment in Multi-Context Systems

Preference-based Inconsistency Assessment in Multi-Context Systems Preference-based Inconsistency Assessment in Multi-Context Systems Thomas Eiter, Michael Fink, and Antonius Weinzierl Institute of Information Systems Vienna University of Technology Favoritenstraße 9-11,

More information

Preferences, Contexts and Answer Sets

Preferences, Contexts and Answer Sets Preferences, Contexts and Answer Sets Gerhard Brewka Computer Science Institute University of Leipzig brewka@informatik.uni-leipzig.de with contributions from T. Eiter, I. Niemelä, M. Truszczyński G. Brewka

More information

Equilibria in Heterogeneous Nonmonotonic Multi-Context Systems

Equilibria in Heterogeneous Nonmonotonic Multi-Context Systems Equilibria in Heterogeneous Nonmonotonic Multi-Context Systems Gerhard Brewka Dept. of Computer Science University of Leipzig Johannisgasse 26, D-04103 Leipzig brewka@informatik.uni-leipzig.de Thomas Eiter

More information

Semantic Reasoning with SPARQL in Heterogeneous Multi-Context Systems

Semantic Reasoning with SPARQL in Heterogeneous Multi-Context Systems Semantic Reasoning with SPARQL in Heterogeneous Multi-Context Systems Peter Schüller and Antonius Weinzierl Institut für Informationssysteme, Technische Universität Wien Favoritenstraße 9-11, A-1040 Vienna,

More information

Preference-Based Inconsistency Management in Multi-Context Systems

Preference-Based Inconsistency Management in Multi-Context Systems Journal of Artificial Intelligence Research 60 (2017) 347-424 Submitted 12/16; published 10/17 Preference-Based Inconsistency Management in Multi-Context Systems Thomas Eiter Technische Universität Wien

More information

Evolving Multi-Context Systems

Evolving Multi-Context Systems Evolving Multi-Context Systems Ricardo Gonçalves and Matthias Knorr and João Leite 1 Abstract. Managed Multi-Context Systems (mmcss) provide a general framework for integrating knowledge represented in

More information

Relational Information Exchange and Aggregation in Multi-Context Systems

Relational Information Exchange and Aggregation in Multi-Context Systems Relational Information Exchange and Aggregation in Multi-Context Systems Michael Fink, Lucantonio Ghionna, and Antonius Weinzierl Institute of Information Systems Vienna University of Technology Favoritenstraße

More information

Distributed Nonmonotonic Multi-Context Systems

Distributed Nonmonotonic Multi-Context Systems Distributed Nonmonotonic Multi-Context Systems Minh Dao-Tran and Thomas Eiter and Michael Fink and Thomas Krennwallner Institute of Information Systems, Vienna University of Technology Favoritenstrasse

More information

Resolving Conflicts in Action Descriptions

Resolving Conflicts in Action Descriptions Resolving Conflicts in Action Descriptions Thomas Eiter and Esra Erdem and Michael Fink and Ján Senko 1 Abstract. We study resolving conflicts between an action description and a set of conditions (possibly

More information

Strong Inconsistency in Nonmonotonic Reasoning

Strong Inconsistency in Nonmonotonic Reasoning Strong Inconsistency in Nonmonotonic Reasoning Gerhard Brewka 1 and Matthias Thimm 2 and Markus Ulbricht 1 1 Department of Computer Science, Leipzig University, Germany 2 Institute for Web Science and

More information

Inconsistency Management for Traffic Regulations

Inconsistency Management for Traffic Regulations Inconsistency Management for Traffic Regulations Harald Beck Thomas Eiter Thomas Krennwallner KBS Group, Institute of Information Systems, Vienna University of Technology AAAI 12 Workshop on Semantic Cities

More information

Streaming Multi-Context Systems

Streaming Multi-Context Systems Streaming Multi-Context Systems Minh Dao-Tran and Thomas Eiter Institute of Information Systems, Vienna University of Technology Favoritenstraße 9-11, A-1040 Vienna, Austria {dao,eiter}@kr.tuwien.ac.at

More information

Declarative Problem Solving and Nonmonotonic Reasoning. Thomas Eiter

Declarative Problem Solving and Nonmonotonic Reasoning. Thomas Eiter Declarative Problem Solving and Nonmonotonic Reasoning Thomas Eiter Institute of Information Systems Vienna University of Technology eiter@kr.tuwien.ac.at KBS Knowledge-Based Systems Group Japan-Austria

More information

Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system):

Knowledge base (KB) = set of sentences in a formal language Declarative approach to building an agent (or other system): Logic Knowledge-based agents Inference engine Knowledge base Domain-independent algorithms Domain-specific content Knowledge base (KB) = set of sentences in a formal language Declarative approach to building

More information

Resolving Conflicts in Action Descriptions

Resolving Conflicts in Action Descriptions Resolving Conflicts in Action Descriptions Thomas Eiter and Esra Erdem and Michael Fink and Ján Senko Institut für Informationssysteme 184/3, Technische Universität Wien Favoritenstraße 9-11, 1040 Wien,

More information

Outline. Complexity Theory. Introduction. What is abduction? Motivation. Reference VU , SS Logic-Based Abduction

Outline. Complexity Theory. Introduction. What is abduction? Motivation. Reference VU , SS Logic-Based Abduction Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 7. Logic-Based Abduction Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien

More information

arxiv: v1 [cs.lo] 12 Sep 2011

arxiv: v1 [cs.lo] 12 Sep 2011 Under consideration for publication in Theory and Practice of Logic Programming 1 Expressiveness of Communication in Answer Set Programming arxiv:1109.2434v1 [cs.lo] 12 Sep 2011 KIM BAUTERS, STEVEN SCHOCKAERT

More information

Evolving Bridge Rules in Evolving Multi-Context Systems

Evolving Bridge Rules in Evolving Multi-Context Systems Evolving Bridge Rules in Evolving Multi-Context Systems Ricardo Gonçalves, Matthias Knorr, and João Leite CENTRIA & Departamento de Informática, Faculdade Ciências e Tecnologia Universidade Nova de Lisboa

More information

A Framework for Representing Ontology Mappings under Probabilities and Inconsistency

A Framework for Representing Ontology Mappings under Probabilities and Inconsistency A Framework for Representing Ontology Mappings under Probabilities and Inconsistency Andrea Calì 1 Thomas Lukasiewicz 2, 3 Livia Predoiu 4 Heiner Stuckenschmidt 4 1 Computing Laboratory, University of

More information

TE C H N I C A L R E P O R T. Model-Based Recasting in Answer-Set Programming INSTITUT FÜR INFORMATIONSSYSTEME DBAI-TR

TE C H N I C A L R E P O R T. Model-Based Recasting in Answer-Set Programming INSTITUT FÜR INFORMATIONSSYSTEME DBAI-TR TE C H N I C A L R E P O R T INSTITUT FÜR INFORMATIONSSYSTEME ABTEILUNG DATENBANKEN UND ARTIFICIAL INTELLIGENCE Model-Based Recasting in Answer-Set Programming DBAI-TR-2013-83 Thomas Eiter Michael Fink

More information

A New Approach to Knowledge Base Revision in DL-Lite

A New Approach to Knowledge Base Revision in DL-Lite A New Approach to Knowledge Base Revision in DL-Lite Zhe Wang and Kewen Wang and Rodney Topor School of ICT, Griffith University Nathan, QLD 4111, Australia Abstract Revising knowledge bases (KBs) in description

More information

Deciding Equivalence between Extended Datalog Programs. A Brief Survey.

Deciding Equivalence between Extended Datalog Programs. A Brief Survey. Deciding Equivalence between Extended Datalog Programs. A Brief Survey. Stefan Woltran Technische Universität Wien A-1040 Vienna, Austria Joint work with: Thomas Eiter, Wolfgang Faber, Michael Fink, Hans

More information

Nested Epistemic Logic Programs

Nested Epistemic Logic Programs Nested Epistemic Logic Programs Kewen Wang 1 and Yan Zhang 2 1 Griffith University, Australia k.wang@griffith.edu.au 2 University of Western Sydney yan@cit.uws.edu.au Abstract. Nested logic programs and

More information

A Brief Introduction to Nonmonotonic Reasoning

A Brief Introduction to Nonmonotonic Reasoning A Brief Introduction to Nonmonotonic Reasoning Gerhard Brewka, Stefan Woltran Computer Science Institute University of Leipzig [brewka,woltran]@informatik.uni-leipzig.de G. Brewka, S. Woltran (Leipzig)

More information

Normal Description Logic Programs as Default Theories

Normal Description Logic Programs as Default Theories Normal Description Logic Programs as Default Theories Yisong Wang Jia-Huai You Liyan Yuan Yi-Dong Shen Nonmon@30 Lexington, Kentucky 1 / 23 Applications of ASP/SAT fall into... 1 Stand alone applications

More information

Uniform Equivalence of Logic Programs under the Stable Model Semantics

Uniform Equivalence of Logic Programs under the Stable Model Semantics In: Proc. 19th International Conference on Logic Programming (ICLP 2003), LNCS, c 2003 Springer. Uniform Equivalence of Logic Programs under the Stable Model Semantics Thomas Eiter and Michael Fink Institut

More information

A theory of modular and dynamic knowledge representation

A theory of modular and dynamic knowledge representation A theory of modular and dynamic knowledge representation Ján Šefránek Institute of Informatics, Comenius University, Mlynská dolina, 842 15 Bratislava, Slovakia, phone: (421-7) 6029 5436, e-mail: sefranek@fmph.uniba.sk

More information

On Solution Correspondences in Answer-Set Programming

On Solution Correspondences in Answer-Set Programming On Solution Correspondences in Answer-Set Programming Thomas Eiter, Hans Tompits, and Stefan Woltran Institut für Informationssysteme, Technische Universität Wien, Favoritenstraße 9 11, A-1040 Vienna,

More information

Answer set programs with optional rules: a possibilistic approach

Answer set programs with optional rules: a possibilistic approach : a possibilistic approach Kim Bauters Steven Schockaert, Martine De Cock, Dirk Vermeir Ghent University, Belgium Department of Applied Mathematics, Computer Science and Statistics August 4, 2013 reasoning

More information

Symmetry Breaking for Distributed Multi-Context Systems

Symmetry Breaking for Distributed Multi-Context Systems Symmetry Breaking for Distributed Multi-Context Systems Christian Drescher 1, Thomas Eiter 2, Michael Fink 2, Thomas Krennwallner 2, and Toby Walsh 1 1 NICTA and University of New South Wales Locked Bag

More information

Infinitary Equilibrium Logic and Strong Equivalence

Infinitary Equilibrium Logic and Strong Equivalence Infinitary Equilibrium Logic and Strong Equivalence Amelia Harrison 1 Vladimir Lifschitz 1 David Pearce 2 Agustín Valverde 3 1 University of Texas, Austin, Texas, USA 2 Universidad Politécnica de Madrid,

More information

Reasoning with Inconsistent and Uncertain Ontologies

Reasoning with Inconsistent and Uncertain Ontologies Reasoning with Inconsistent and Uncertain Ontologies Guilin Qi Southeast University China gqi@seu.edu.cn Reasoning Web 2012 September 05, 2012 Outline Probabilistic logic vs possibilistic logic Probabilistic

More information

Realizing Default Logic over Description Logic Knowledge Bases. Minh Dao-Tran, Thomas Eiter, Thomas Krennwallner

Realizing Default Logic over Description Logic Knowledge Bases. Minh Dao-Tran, Thomas Eiter, Thomas Krennwallner Realizing Default Logic over Description Logic Knowledge Bases Minh Dao-Tran, Thomas Eiter, Thomas Krennwallner KBS Group, Institute of Information Systems, Vienna University of Technology ECSQARU 2009

More information

Incomplete Information in RDF

Incomplete Information in RDF Incomplete Information in RDF Charalampos Nikolaou and Manolis Koubarakis charnik@di.uoa.gr koubarak@di.uoa.gr Department of Informatics and Telecommunications National and Kapodistrian University of Athens

More information

PRUNING PROCEDURE FOR INCOMPLETE-OBSERVATION DIAGNOSTIC MODEL SIMPLIFICATION

PRUNING PROCEDURE FOR INCOMPLETE-OBSERVATION DIAGNOSTIC MODEL SIMPLIFICATION PRUNING PROCEDURE FOR INCOMPLETE-OBSERVATION DIAGNOSTIC MODEL SIMPLIFICATION Ivan Havel Department of Cybernetics Faculty of Electrical Engineering, Czech Technical University Karlovo náměstí 13, 121 35

More information

Non-monotonic Logic I

Non-monotonic Logic I Non-monotonic Logic I Bridges between classical and non-monotonic consequences Michal Peliš 1 Common reasoning monotonicity Γ ϕ Γ ϕ can fail caused by: background knowledge, implicit facts, presuppositions,

More information

COMMUNICATING ANSWER SET PROGRAMS

COMMUNICATING ANSWER SET PROGRAMS Technical Communications of the International Conference on Logic Programming, 2010 (Edinburgh), pp. 34 43 http://www.floc-conference.org/iclp-home.html COMMUNICATING ANSWER SET PROGRAMS KIM BAUTERS 1

More information

Combining Answer Sets of Nonmonotonic Logic Programs

Combining Answer Sets of Nonmonotonic Logic Programs Combining Answer Sets of Nonmonotonic Logic Programs Chiaki Sakama 1 and Katsumi Inoue 2 1 Department of Computer and Communication Sciences Wakayama University, Sakaedani, Wakayama 640-8510, Japan sakama@sys.wakayama-u.ac.jp

More information

Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case

Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case Strong and Uniform Equivalence in Answer-Set Programming: Characterizations and Complexity Results for the Non-Ground Case Thomas Eiter, Michael Fink, Hans Tompits, and Stefan Woltran Institut für Informationssysteme

More information

Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs

Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs Mirosław Truszczyński Department of Computer Science, University of Kentucky, Lexington, KY 40506, USA Abstract. We present

More information

Towards Better Response Times and Higher-Quality Queries in Interactive Knowledge Base Debugging

Towards Better Response Times and Higher-Quality Queries in Interactive Knowledge Base Debugging Towards Better Response Times and Higher-Quality Queries in Interactive Knowledge Base Debugging Patrick Rodler Alpen-Adria Universität, Klagenfurt, 9020 Austria patrick.rodler@aau.at March 28, 2018 arxiv:1609.02584v2

More information

Using C-OWL for the Alignment and Merging of Medical Ontologies

Using C-OWL for the Alignment and Merging of Medical Ontologies Using C-OWL for the Alignment and Merging of Medical Ontologies Heiner Stuckenschmidt 1, Frank van Harmelen 1 Paolo Bouquet 2,3, Fausto Giunchiglia 2,3, Luciano Serafini 3 1 Vrije Universiteit Amsterdam

More information

Tutorial: Nonmonotonic Logic

Tutorial: Nonmonotonic Logic Tutorial: Nonmonotonic Logic PhDs in Logic (2017) Christian Straßer May 2, 2017 Outline Defeasible Reasoning Scratching the Surface of Nonmonotonic Logic 1/52 Defeasible Reasoning What is defeasible reasoning?

More information

Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web

Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web Tightly Coupled Probabilistic Description Logic Programs for the Semantic Web Andrea Calì 1, Thomas Lukasiewicz 1, 2, Livia Predoiu 3, and Heiner Stuckenschmidt 3 1 Computing Laboratory, University of

More information

On the Complexity of Dealing with Inconsistency in Description Logic Ontologies

On the Complexity of Dealing with Inconsistency in Description Logic Ontologies Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence On the Complexity of Dealing with Inconsistency in Description Logic Ontologies Riccardo Rosati Dipartimento di

More information

Week 4. COMP62342 Sean Bechhofer, Uli Sattler

Week 4. COMP62342 Sean Bechhofer, Uli Sattler Week 4 COMP62342 Sean Bechhofer, Uli Sattler sean.bechhofer@manchester.ac.uk, uli.sattler@manchester.ac.uk Today Some clarifications from last week s coursework More on reasoning: extension of the tableau

More information

Argumentative Characterisations of Non-monotonic Inference in Preferred Subtheories: Stable Equals Preferred

Argumentative Characterisations of Non-monotonic Inference in Preferred Subtheories: Stable Equals Preferred Argumentative Characterisations of Non-monotonic Inference in Preferred Subtheories: Stable Equals Preferred Sanjay Modgil November 17, 2017 Abstract A number of argumentation formalisms provide dialectical

More information

Designing and Evaluating Generic Ontologies

Designing and Evaluating Generic Ontologies Designing and Evaluating Generic Ontologies Michael Grüninger Department of Industrial Engineering University of Toronto gruninger@ie.utoronto.ca August 28, 2007 1 Introduction One of the many uses of

More information

Loop Formulas for Description Logic Programs

Loop Formulas for Description Logic Programs Loop Formulas for Description Logic Programs Yisong Wang 1, Jia-Huai You 2, Li-Yan Yuan 2, Yidong Shen 3 1 Guizhou University, China 2 University of Alberta, Canada 3 Institute of Software, Chinese Academy

More information

Well-Supported Semantics for Description Logic Programs

Well-Supported Semantics for Description Logic Programs Well-Supported Semantics for Description Logic Programs Yi-Dong Shen Institute of Software, Chinese Academy of Sciences, Beijing, China http://lcs.ios.ac.cn/~ydshen IJCAI 2011, Barcelona, Spain Outline

More information

INTRODUCTION TO NONMONOTONIC REASONING

INTRODUCTION TO NONMONOTONIC REASONING Faculty of Computer Science Chair of Automata Theory INTRODUCTION TO NONMONOTONIC REASONING Anni-Yasmin Turhan Dresden, WS 2017/18 About the Course Course Material Book "Nonmonotonic Reasoning" by Grigoris

More information

Description Logics. Foundations of Propositional Logic. franconi. Enrico Franconi

Description Logics. Foundations of Propositional Logic.   franconi. Enrico Franconi (1/27) Description Logics Foundations of Propositional Logic Enrico Franconi franconi@cs.man.ac.uk http://www.cs.man.ac.uk/ franconi Department of Computer Science, University of Manchester (2/27) Knowledge

More information

Distributed Defeasible Reasoning in Multi-Context Systems

Distributed Defeasible Reasoning in Multi-Context Systems Distributed Defeasible Reasoning in Multi-Context Systems Antonis Bikakis and Grigoris Antoniou Institute of Computer Science, FO.R.T.H. Vassilika Vouton, P.O. Box 1385, GR 71110, Heraklion, Greece {bikakis,antoniou}@ics.forth.gr

More information

Artificial Intelligence

Artificial Intelligence Artificial Intelligence 174 (2010) 1172 1221 Contents lists available at ScienceDirect Artificial Intelligence www.elsevier.com/locate/artint Updating action domain descriptions Thomas Eiter a,esraerdem

More information

Interactive ontology debugging: two query strategies for efficient fault localization

Interactive ontology debugging: two query strategies for efficient fault localization Interactive ontology debugging: two query strategies for efficient fault localization Kostyantyn Shchekotykhin a,, Gerhard Friedrich a, Philipp Fleiss a,1, Patrick Rodler a,1 a Alpen-Adria Universität,

More information

Bayesian Description Logics

Bayesian Description Logics Bayesian Description Logics İsmail İlkan Ceylan1 and Rafael Peñaloza 1,2 1 Theoretical Computer Science, TU Dresden, Germany 2 Center for Advancing Electronics Dresden {ceylan,penaloza}@tcs.inf.tu-dresden.de

More information

Revising General Knowledge Bases in Description Logics

Revising General Knowledge Bases in Description Logics Revising General Knowledge Bases in Description Logics Zhe Wang and Kewen Wang and Rodney Topor Griffith University, Australia Abstract Revising knowledge bases (KBs) in description logics (DLs) in a syntax-independent

More information

Quantified Boolean Formulas Part 1

Quantified Boolean Formulas Part 1 Quantified Boolean Formulas Part 1 Uwe Egly Knowledge-Based Systems Group Institute of Information Systems Vienna University of Technology Results of the SAT 2009 application benchmarks for leading solvers

More information

Propositional Logic: Logical Agents (Part I)

Propositional Logic: Logical Agents (Part I) Propositional Logic: Logical Agents (Part I) First Lecture Today (Tue 21 Jun) Read Chapters 1 and 2 Second Lecture Today (Tue 21 Jun) Read Chapter 7.1-7.4 Next Lecture (Thu 23 Jun) Read Chapters 7.5 (optional:

More information

A Logic Programming Approach to Querying and Integrating P2P Deductive Databases

A Logic Programming Approach to Querying and Integrating P2P Deductive Databases A Logic rogramming Approach to Querying and Integrating 2 Deductive Databases L. Caroprese, S. Greco and E. Zumpano DEIS, Univ. della Calabria 87030 Rende, Italy {lcaroprese, greco, zumpano}@deis.unical.it

More information

Outline. Formale Methoden der Informatik First-Order Logic for Forgetters. Why PL1? Why PL1? Cont d. Motivation

Outline. Formale Methoden der Informatik First-Order Logic for Forgetters. Why PL1? Why PL1? Cont d. Motivation Outline Formale Methoden der Informatik First-Order Logic for Forgetters Uwe Egly Vienna University of Technology Institute of Information Systems Knowledge-Based Systems Group Motivation Syntax of PL1

More information

Revision of DL-Lite Knowledge Bases

Revision of DL-Lite Knowledge Bases Revision of DL-Lite Knowledge Bases Zhe Wang, Kewen Wang, and Rodney Topor Griffith University, Australia Abstract. We address the revision problem for knowledge bases (KBs) in Description Logics (DLs).

More information

Diagnosing Automatic Whitelisting for Dynamic Remarketing Ads Using Hybrid ASP

Diagnosing Automatic Whitelisting for Dynamic Remarketing Ads Using Hybrid ASP Diagnosing Automatic Whitelisting for Dynamic Remarketing Ads Using Hybrid ASP Alex Brik 1 and Jeffrey B. Remmel 2 LPNMR 2015 September 2015 1 Google Inc 2 UC San Diego lex Brik and Jeffrey B. Remmel (LPNMR

More information

Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs

Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs Miroslaw Truszczyński Department of Computer Science, University of Kentucky, Lexington,

More information

Model Checking for Modal Intuitionistic Dependence Logic

Model Checking for Modal Intuitionistic Dependence Logic 1/71 Model Checking for Modal Intuitionistic Dependence Logic Fan Yang Department of Mathematics and Statistics University of Helsinki Logical Approaches to Barriers in Complexity II Cambridge, 26-30 March,

More information

Theoretical Computer Science. The loop formula based semantics of description logic programs

Theoretical Computer Science. The loop formula based semantics of description logic programs Theoretical Computer Science 415 (2012) 60 85 Contents lists available at SciVerse ScienceDirect Theoretical Computer Science journal homepage: www.elsevier.com/locate/tcs The loop formula based semantics

More information

What makes propositional abduction tractable

What makes propositional abduction tractable What makes propositional abduction tractable Gustav Nordh 1 LIX, École Polytechnique Route de Saclay F-91 128 Palaiseau, France Bruno Zanuttini GREYC, UMR CNRS 6072 Université de Caen Bd. du Maréchal Juin

More information

The Representation of Medical Reasoning Models in Resolution-based Theorem Provers

The Representation of Medical Reasoning Models in Resolution-based Theorem Provers The Representation of Medical Reasoning Models in Resolution-based Theorem Provers Originally Presented by Peter Lucas Department of Computer Science, Utrecht University Presented by Sarbartha Sengupta

More information

LTCS Report. Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures. LTCS-Report 16-07

LTCS Report. Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity Measures. LTCS-Report 16-07 Technische Universität Dresden Institute for Theoretical Computer Science Chair for Automata Theory LTCS Report Decidability and Complexity of Threshold Description Logics Induced by Concept Similarity

More information

GAV-sound with conjunctive queries

GAV-sound with conjunctive queries GAV-sound with conjunctive queries Source and global schema as before: source R 1 (A, B),R 2 (B,C) Global schema: T 1 (A, C), T 2 (B,C) GAV mappings become sound: T 1 {x, y, z R 1 (x,y) R 2 (y,z)} T 2

More information

Declarative Merging of and Reasoning about Decision Diagrams

Declarative Merging of and Reasoning about Decision Diagrams Declarative Merging of and Reasoning about Decision Diagrams Thomas Eiter Thomas Krennwallner Christoph Redl {eiter,tkren,redl}@kr.tuwien.ac.at September 12, 2011 Eiter T., Krennwallner T., Redl C. (TU

More information

A Theory of Forgetting in Logic Programming

A Theory of Forgetting in Logic Programming A Theory of Forgetting in Logic Programming Kewen Wang 1,2 and Abdul Sattar 1,2 and Kaile Su 1 1 Institute for Integrated Intelligent Systems 2 School of Information and Computation Technology Griffith

More information

Modeling and reasoning with uncertainty

Modeling and reasoning with uncertainty CS 2710 Foundations of AI Lecture 18 Modeling and reasoning with uncertainty Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square KB systems. Medical example. We want to build a KB system for the diagnosis

More information

Compiling Stratified Belief Bases

Compiling Stratified Belief Bases Compiling Stratified Belief Bases Sylvie Coste-Marquis 1 and Pierre Marquis 2 Abstract. Many coherence-based approaches to inconsistency handling within propositional belief bases have been proposed so

More information

The Bayesian Ontology Language BEL

The Bayesian Ontology Language BEL Journal of Automated Reasoning manuscript No. (will be inserted by the editor) The Bayesian Ontology Language BEL İsmail İlkan Ceylan Rafael Peñaloza Received: date / Accepted: date Abstract We introduce

More information

Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs

Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs Xiaoping Chen 1, Jianmin Ji 1, and Fangzhen Lin 2 1 School of Computer Science and Technology, University of Science

More information

A Goal-Oriented Algorithm for Unification in EL w.r.t. Cycle-Restricted TBoxes

A Goal-Oriented Algorithm for Unification in EL w.r.t. Cycle-Restricted TBoxes A Goal-Oriented Algorithm for Unification in EL w.r.t. Cycle-Restricted TBoxes Franz Baader, Stefan Borgwardt, and Barbara Morawska {baader,stefborg,morawska}@tcs.inf.tu-dresden.de Theoretical Computer

More information

Weighted Abstract Dialectical Frameworks

Weighted Abstract Dialectical Frameworks Weighted Abstract Dialectical Frameworks Gerhard Brewka Computer Science Institute University of Leipzig brewka@informatik.uni-leipzig.de joint work with H. Strass, J. Wallner, S. Woltran G. Brewka (Leipzig)

More information

Annotated revision programs

Annotated revision programs Annotated revision programs Victor Marek Inna Pivkina Miros law Truszczyński Department of Computer Science, University of Kentucky, Lexington, KY 40506-0046 marek inna mirek@cs.engr.uky.edu Abstract Revision

More information

Liberal Safety for Answer Set Programs with External Sources

Liberal Safety for Answer Set Programs with External Sources Liberal Safety for Answer Set Programs with External Sources Thomas Eiter, Michael Fink, Thomas Krennwallner, Christoph Redl {eiter,fink,tkren,redl}@kr.tuwien.ac.at July 16, 2013 Redl C. (TU Vienna) HEX-Programs

More information

DATA REPAIR OF INCONSISTENT NONMONOTONIC DESCRIPTION LOGIC PROGRAMS

DATA REPAIR OF INCONSISTENT NONMONOTONIC DESCRIPTION LOGIC PROGRAMS I N F S Y S R E S E A R C H R E P O R T INSTITUT FÜR INFORMATIONSSYSTEME ARBEITSBEREICH WISSENSBASIERTE SYSTEME DATA REPAIR OF INCONSISTENT NONMONOTONIC DESCRIPTION LOGIC PROGRAMS THOMAS EITER MICHAEL

More information

Propositional Logic: Models and Proofs

Propositional Logic: Models and Proofs Propositional Logic: Models and Proofs C. R. Ramakrishnan CSE 505 1 Syntax 2 Model Theory 3 Proof Theory and Resolution Compiled at 11:51 on 2016/11/02 Computing with Logic Propositional Logic CSE 505

More information

A Formal Logical Framework for Cadiag-2

A Formal Logical Framework for Cadiag-2 648 Medical Informatics in a United and Healthy Europe K-P Adlassnig et al (Eds) IOS Press, 29 29 European Federation for Medical Informatics All rights reserved doi:12/978-1-675-44-5-648 A Formal Logical

More information

Concepts for decision making under severe uncertainty with partial ordinal and partial cardinal preferences

Concepts for decision making under severe uncertainty with partial ordinal and partial cardinal preferences Concepts for decision making under severe uncertainty with partial ordinal and partial cardinal preferences Christoph Jansen Georg Schollmeyer Thomas Augustin Department of Statistics, LMU Munich ISIPTA

More information

I N F S Y S R E S E A R C H R E P O R T A MODEL BUILDING FRAMEWORK FOR ANSWER SET PROGRAMMING WITH EXTERNAL COMPUTATIONS

I N F S Y S R E S E A R C H R E P O R T A MODEL BUILDING FRAMEWORK FOR ANSWER SET PROGRAMMING WITH EXTERNAL COMPUTATIONS I N F S Y S R E S E A R C H R E P O R T INSTITUT FÜR INFORMATIONSSYSTEME ARBEITSBEREICH WISSENSBASIERTE SYSTEME A MODEL BUILDING FRAMEWORK FOR ANSWER SET PROGRAMMING WITH EXTERNAL COMPUTATIONS THOMAS EITER

More information

Fuzzy Answer Set semantics for Residuated Logic programs

Fuzzy Answer Set semantics for Residuated Logic programs semantics for Logic Nicolás Madrid & Universidad de Málaga September 23, 2009 Aims of this paper We are studying the introduction of two kinds of negations into residuated : Default negation: This negation

More information

Multi-Context Systems for Reactive Reasoning in Dynamic Environments 1

Multi-Context Systems for Reactive Reasoning in Dynamic Environments 1 Multi-Context Systems for Reactive Reasoning in Dynamic Environments 1 Gerhard Brewka and Stefan Ellmauthaler and Jörg Pührer 2 arxiv:1505.05366v1 [cs.ai] 20 May 2015 Abstract. We show in this paper how

More information

Chapter 7 R&N ICS 271 Fall 2017 Kalev Kask

Chapter 7 R&N ICS 271 Fall 2017 Kalev Kask Set 6: Knowledge Representation: The Propositional Calculus Chapter 7 R&N ICS 271 Fall 2017 Kalev Kask Outline Representing knowledge using logic Agent that reason logically A knowledge based agent Representing

More information

A Unified Framework for Representing Logic Program Updates

A Unified Framework for Representing Logic Program Updates A Unified Framework for Representing Logic Program Updates Yan Zhang School of Computing & Information Technology University of Western Sydney NSW 1797 Australia E-mail: yan@cit.uws.edu.au Norman Foo School

More information

An Abstract View on Modularity in Knowledge Representation

An Abstract View on Modularity in Knowledge Representation University of Nebraska at Omaha DigitalCommons@UNO Computer Science Faculty Proceedings & Presentations Department of Computer Science 1-2015 An Abstract View on Modularity in Knowledge Representation

More information

Notions of Strong Equivalence for Logic Programs with Ordered Disjunction

Notions of Strong Equivalence for Logic Programs with Ordered Disjunction Notions of Strong Equivalence for Logic Programs with Ordered Disjunction Wolfgang Faber Department of Mathematics University of Calabria Via P. Bucci, cubo 30b 87036 Rende (CS), Italy wf@wfaber.com Hans

More information

Two-Valued Logic Programs

Two-Valued Logic Programs Two-Valued Logic Programs Vladimir Lifschitz University of Texas at Austin, USA Abstract We define a nonmonotonic formalism that shares some features with three other systems of nonmonotonic reasoning

More information

Master Thesis (Extended Abstract) Inconsistency Management for Traffic Regulations

Master Thesis (Extended Abstract) Inconsistency Management for Traffic Regulations Master Thesis (Extended Abstract) Inconsistency Management for Traffic Regulations Harald Beck Institut für Informationssysteme 184/3, Technische Universität Wien Favoritenstraße 9-11, A-1040 Vienna, Austria

More information

Lecture 7: Logic and Planning

Lecture 7: Logic and Planning Lecture 7: Logic and Planning Planning and representing knowledge Logic in general Propositional (Boolean) logic and its application to planning COMP-424, Lecture 8 - January 30, 2013 1 What is planning?

More information

Splitting a Logic Program Revisited

Splitting a Logic Program Revisited Splitting a Logic Program Revisited Jianmin Ji School of Computer Science and Technology University of Science and Technology of China Hefei 230027, China jianmin@ustc.edu.cn Hai Wan and Ziwei Huo and

More information

Inconsistency Management for Traffic Regulations: Formalization and Complexity Results

Inconsistency Management for Traffic Regulations: Formalization and Complexity Results Inconsistency Management for Traffic Regulations: Formalization and Complexity Results Harald Beck, Thomas Eiter, and Thomas Krennwallner Institute of Information Systems, Vienna University of Technology

More information

Parallel-Correctness and Transferability for Conjunctive Queries

Parallel-Correctness and Transferability for Conjunctive Queries Parallel-Correctness and Transferability for Conjunctive Queries Tom J. Ameloot1 Gaetano Geck2 Bas Ketsman1 Frank Neven1 Thomas Schwentick2 1 Hasselt University 2 Dortmund University Big Data Too large

More information

Reasoning under inconsistency: the forgotten connective

Reasoning under inconsistency: the forgotten connective Reasoning under inconsistency: the forgotten connective Sébastien Konieczny CRIL - Université d Artois 62307 Lens, France konieczny@cril.univ-artois.fr Jérôme Lang IRIT - Université Paul Sabatier 31062

More information

Data Dependencies in the Presence of Difference

Data Dependencies in the Presence of Difference Data Dependencies in the Presence of Difference Tsinghua University sxsong@tsinghua.edu.cn Outline Introduction Application Foundation Discovery Conclusion and Future Work Data Dependencies in the Presence

More information

Knowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom.

Knowledge representation DATA INFORMATION KNOWLEDGE WISDOM. Figure Relation ship between data, information knowledge and wisdom. Knowledge representation Introduction Knowledge is the progression that starts with data which s limited utility. Data when processed become information, information when interpreted or evaluated becomes

More information