Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations
Abstract Several different semantics have been proposed for conditional knowledge bases $\mathcal {R}$ containing qualitative conditionals of the form “If A, then usually B”, leading to different nonmonotonic inference relations induced by $\mathcal {R}$. For the notion of c-representations which ar...
Ausführliche Beschreibung
Autor*in: |
Beierle, Christoph [verfasserIn] |
---|
Format: |
Artikel |
---|---|
Sprache: |
Englisch |
Erschienen: |
2019 |
---|
Schlagwörter: |
---|
Anmerkung: |
© Springer Nature Switzerland AG 2019 |
---|
Übergeordnetes Werk: |
Enthalten in: Annals of mathematics and artificial intelligence - Springer International Publishing, 1990, 87(2019), 1-2 vom: 30. Aug., Seite 5-41 |
---|---|
Übergeordnetes Werk: |
volume:87 ; year:2019 ; number:1-2 ; day:30 ; month:08 ; pages:5-41 |
Links: |
---|
DOI / URN: |
10.1007/s10472-019-09653-7 |
---|
Katalog-ID: |
OLC2041508329 |
---|
LEADER | 01000caa a22002652 4500 | ||
---|---|---|---|
001 | OLC2041508329 | ||
003 | DE-627 | ||
005 | 20230502200419.0 | ||
007 | tu | ||
008 | 200820s2019 xx ||||| 00| ||eng c | ||
024 | 7 | |a 10.1007/s10472-019-09653-7 |2 doi | |
035 | |a (DE-627)OLC2041508329 | ||
035 | |a (DE-He213)s10472-019-09653-7-p | ||
040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
041 | |a eng | ||
082 | 0 | 4 | |a 510 |a 004 |q VZ |
084 | |a 17,1 |2 ssgn | ||
100 | 1 | |a Beierle, Christoph |e verfasserin |4 aut | |
245 | 1 | 0 | |a Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations |
264 | 1 | |c 2019 | |
336 | |a Text |b txt |2 rdacontent | ||
337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
338 | |a Band |b nc |2 rdacarrier | ||
500 | |a © Springer Nature Switzerland AG 2019 | ||
520 | |a Abstract Several different semantics have been proposed for conditional knowledge bases $\mathcal {R}$ containing qualitative conditionals of the form “If A, then usually B”, leading to different nonmonotonic inference relations induced by $\mathcal {R}$. For the notion of c-representations which are a subclass of all ranking functions accepting $\mathcal {R}$, a skeptical inference relation, called c-inference and taking all c-representations of $\mathcal {R}$ into account, has been suggested. In this article, we develop a 3-phase compilation scheme for both knowledge bases and skeptical queries to constraint satisfaction problems. In addition to skeptical c-inference, we show how also credulous and weakly skeptical c-inference can be modelled as constraint satisfaction problems, and that the compilation scheme can be extended to such queries. We further extend the compilation approach to knowledge bases evolving over time. The compiled form of $\mathcal {R}$ is reused for incrementally compiling extensions, contractions, and updates of $\mathcal {R}$. For each compilation step, we prove its soundness and completeness, and demonstrate significant efficiency benefits when querying the compiled version of $\mathcal {R}$. These findings are also supported by experiments with the software system InfOCF that employs the proposed compilation scheme. | ||
650 | 4 | |a Conditional | |
650 | 4 | |a Conditional knowledge base | |
650 | 4 | |a c-representation | |
650 | 4 | |a Skeptical c-inference | |
650 | 4 | |a Weakly skeptical c-inference | |
650 | 4 | |a Credulous c-inference | |
650 | 4 | |a Constraint satisfaction problem | |
650 | 4 | |a Knowledge base compilation | |
650 | 4 | |a Knowledge base modification | |
650 | 4 | |a Incremental compilation | |
700 | 1 | |a Kutsch, Steven |4 aut | |
700 | 1 | |a Sauerwald, Kai |4 aut | |
773 | 0 | 8 | |i Enthalten in |t Annals of mathematics and artificial intelligence |d Springer International Publishing, 1990 |g 87(2019), 1-2 vom: 30. Aug., Seite 5-41 |w (DE-627)130904104 |w (DE-600)1045926-1 |w (DE-576)02499622X |x 1012-2443 |7 nnns |
773 | 1 | 8 | |g volume:87 |g year:2019 |g number:1-2 |g day:30 |g month:08 |g pages:5-41 |
856 | 4 | 1 | |u https://doi.org/10.1007/s10472-019-09653-7 |z lizenzpflichtig |3 Volltext |
912 | |a GBV_USEFLAG_A | ||
912 | |a SYSFLAG_A | ||
912 | |a GBV_OLC | ||
912 | |a SSG-OLC-MAT | ||
912 | |a SSG-OPC-MAT | ||
912 | |a GBV_ILN_70 | ||
951 | |a AR | ||
952 | |d 87 |j 2019 |e 1-2 |b 30 |c 08 |h 5-41 |
author_variant |
c b cb s k sk k s ks |
---|---|
matchkey_str |
article:10122443:2019----::opltoosaiadvligodtoakoldeaefroptnidcdom |
hierarchy_sort_str |
2019 |
publishDate |
2019 |
allfields |
10.1007/s10472-019-09653-7 doi (DE-627)OLC2041508329 (DE-He213)s10472-019-09653-7-p DE-627 ger DE-627 rakwb eng 510 004 VZ 17,1 ssgn Beierle, Christoph verfasserin aut Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Nature Switzerland AG 2019 Abstract Several different semantics have been proposed for conditional knowledge bases $\mathcal {R}$ containing qualitative conditionals of the form “If A, then usually B”, leading to different nonmonotonic inference relations induced by $\mathcal {R}$. For the notion of c-representations which are a subclass of all ranking functions accepting $\mathcal {R}$, a skeptical inference relation, called c-inference and taking all c-representations of $\mathcal {R}$ into account, has been suggested. In this article, we develop a 3-phase compilation scheme for both knowledge bases and skeptical queries to constraint satisfaction problems. In addition to skeptical c-inference, we show how also credulous and weakly skeptical c-inference can be modelled as constraint satisfaction problems, and that the compilation scheme can be extended to such queries. We further extend the compilation approach to knowledge bases evolving over time. The compiled form of $\mathcal {R}$ is reused for incrementally compiling extensions, contractions, and updates of $\mathcal {R}$. For each compilation step, we prove its soundness and completeness, and demonstrate significant efficiency benefits when querying the compiled version of $\mathcal {R}$. These findings are also supported by experiments with the software system InfOCF that employs the proposed compilation scheme. Conditional Conditional knowledge base c-representation Skeptical c-inference Weakly skeptical c-inference Credulous c-inference Constraint satisfaction problem Knowledge base compilation Knowledge base modification Incremental compilation Kutsch, Steven aut Sauerwald, Kai aut Enthalten in Annals of mathematics and artificial intelligence Springer International Publishing, 1990 87(2019), 1-2 vom: 30. Aug., Seite 5-41 (DE-627)130904104 (DE-600)1045926-1 (DE-576)02499622X 1012-2443 nnns volume:87 year:2019 number:1-2 day:30 month:08 pages:5-41 https://doi.org/10.1007/s10472-019-09653-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 AR 87 2019 1-2 30 08 5-41 |
spelling |
10.1007/s10472-019-09653-7 doi (DE-627)OLC2041508329 (DE-He213)s10472-019-09653-7-p DE-627 ger DE-627 rakwb eng 510 004 VZ 17,1 ssgn Beierle, Christoph verfasserin aut Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Nature Switzerland AG 2019 Abstract Several different semantics have been proposed for conditional knowledge bases $\mathcal {R}$ containing qualitative conditionals of the form “If A, then usually B”, leading to different nonmonotonic inference relations induced by $\mathcal {R}$. For the notion of c-representations which are a subclass of all ranking functions accepting $\mathcal {R}$, a skeptical inference relation, called c-inference and taking all c-representations of $\mathcal {R}$ into account, has been suggested. In this article, we develop a 3-phase compilation scheme for both knowledge bases and skeptical queries to constraint satisfaction problems. In addition to skeptical c-inference, we show how also credulous and weakly skeptical c-inference can be modelled as constraint satisfaction problems, and that the compilation scheme can be extended to such queries. We further extend the compilation approach to knowledge bases evolving over time. The compiled form of $\mathcal {R}$ is reused for incrementally compiling extensions, contractions, and updates of $\mathcal {R}$. For each compilation step, we prove its soundness and completeness, and demonstrate significant efficiency benefits when querying the compiled version of $\mathcal {R}$. These findings are also supported by experiments with the software system InfOCF that employs the proposed compilation scheme. Conditional Conditional knowledge base c-representation Skeptical c-inference Weakly skeptical c-inference Credulous c-inference Constraint satisfaction problem Knowledge base compilation Knowledge base modification Incremental compilation Kutsch, Steven aut Sauerwald, Kai aut Enthalten in Annals of mathematics and artificial intelligence Springer International Publishing, 1990 87(2019), 1-2 vom: 30. Aug., Seite 5-41 (DE-627)130904104 (DE-600)1045926-1 (DE-576)02499622X 1012-2443 nnns volume:87 year:2019 number:1-2 day:30 month:08 pages:5-41 https://doi.org/10.1007/s10472-019-09653-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 AR 87 2019 1-2 30 08 5-41 |
allfields_unstemmed |
10.1007/s10472-019-09653-7 doi (DE-627)OLC2041508329 (DE-He213)s10472-019-09653-7-p DE-627 ger DE-627 rakwb eng 510 004 VZ 17,1 ssgn Beierle, Christoph verfasserin aut Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Nature Switzerland AG 2019 Abstract Several different semantics have been proposed for conditional knowledge bases $\mathcal {R}$ containing qualitative conditionals of the form “If A, then usually B”, leading to different nonmonotonic inference relations induced by $\mathcal {R}$. For the notion of c-representations which are a subclass of all ranking functions accepting $\mathcal {R}$, a skeptical inference relation, called c-inference and taking all c-representations of $\mathcal {R}$ into account, has been suggested. In this article, we develop a 3-phase compilation scheme for both knowledge bases and skeptical queries to constraint satisfaction problems. In addition to skeptical c-inference, we show how also credulous and weakly skeptical c-inference can be modelled as constraint satisfaction problems, and that the compilation scheme can be extended to such queries. We further extend the compilation approach to knowledge bases evolving over time. The compiled form of $\mathcal {R}$ is reused for incrementally compiling extensions, contractions, and updates of $\mathcal {R}$. For each compilation step, we prove its soundness and completeness, and demonstrate significant efficiency benefits when querying the compiled version of $\mathcal {R}$. These findings are also supported by experiments with the software system InfOCF that employs the proposed compilation scheme. Conditional Conditional knowledge base c-representation Skeptical c-inference Weakly skeptical c-inference Credulous c-inference Constraint satisfaction problem Knowledge base compilation Knowledge base modification Incremental compilation Kutsch, Steven aut Sauerwald, Kai aut Enthalten in Annals of mathematics and artificial intelligence Springer International Publishing, 1990 87(2019), 1-2 vom: 30. Aug., Seite 5-41 (DE-627)130904104 (DE-600)1045926-1 (DE-576)02499622X 1012-2443 nnns volume:87 year:2019 number:1-2 day:30 month:08 pages:5-41 https://doi.org/10.1007/s10472-019-09653-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 AR 87 2019 1-2 30 08 5-41 |
allfieldsGer |
10.1007/s10472-019-09653-7 doi (DE-627)OLC2041508329 (DE-He213)s10472-019-09653-7-p DE-627 ger DE-627 rakwb eng 510 004 VZ 17,1 ssgn Beierle, Christoph verfasserin aut Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Nature Switzerland AG 2019 Abstract Several different semantics have been proposed for conditional knowledge bases $\mathcal {R}$ containing qualitative conditionals of the form “If A, then usually B”, leading to different nonmonotonic inference relations induced by $\mathcal {R}$. For the notion of c-representations which are a subclass of all ranking functions accepting $\mathcal {R}$, a skeptical inference relation, called c-inference and taking all c-representations of $\mathcal {R}$ into account, has been suggested. In this article, we develop a 3-phase compilation scheme for both knowledge bases and skeptical queries to constraint satisfaction problems. In addition to skeptical c-inference, we show how also credulous and weakly skeptical c-inference can be modelled as constraint satisfaction problems, and that the compilation scheme can be extended to such queries. We further extend the compilation approach to knowledge bases evolving over time. The compiled form of $\mathcal {R}$ is reused for incrementally compiling extensions, contractions, and updates of $\mathcal {R}$. For each compilation step, we prove its soundness and completeness, and demonstrate significant efficiency benefits when querying the compiled version of $\mathcal {R}$. These findings are also supported by experiments with the software system InfOCF that employs the proposed compilation scheme. Conditional Conditional knowledge base c-representation Skeptical c-inference Weakly skeptical c-inference Credulous c-inference Constraint satisfaction problem Knowledge base compilation Knowledge base modification Incremental compilation Kutsch, Steven aut Sauerwald, Kai aut Enthalten in Annals of mathematics and artificial intelligence Springer International Publishing, 1990 87(2019), 1-2 vom: 30. Aug., Seite 5-41 (DE-627)130904104 (DE-600)1045926-1 (DE-576)02499622X 1012-2443 nnns volume:87 year:2019 number:1-2 day:30 month:08 pages:5-41 https://doi.org/10.1007/s10472-019-09653-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 AR 87 2019 1-2 30 08 5-41 |
allfieldsSound |
10.1007/s10472-019-09653-7 doi (DE-627)OLC2041508329 (DE-He213)s10472-019-09653-7-p DE-627 ger DE-627 rakwb eng 510 004 VZ 17,1 ssgn Beierle, Christoph verfasserin aut Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations 2019 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Springer Nature Switzerland AG 2019 Abstract Several different semantics have been proposed for conditional knowledge bases $\mathcal {R}$ containing qualitative conditionals of the form “If A, then usually B”, leading to different nonmonotonic inference relations induced by $\mathcal {R}$. For the notion of c-representations which are a subclass of all ranking functions accepting $\mathcal {R}$, a skeptical inference relation, called c-inference and taking all c-representations of $\mathcal {R}$ into account, has been suggested. In this article, we develop a 3-phase compilation scheme for both knowledge bases and skeptical queries to constraint satisfaction problems. In addition to skeptical c-inference, we show how also credulous and weakly skeptical c-inference can be modelled as constraint satisfaction problems, and that the compilation scheme can be extended to such queries. We further extend the compilation approach to knowledge bases evolving over time. The compiled form of $\mathcal {R}$ is reused for incrementally compiling extensions, contractions, and updates of $\mathcal {R}$. For each compilation step, we prove its soundness and completeness, and demonstrate significant efficiency benefits when querying the compiled version of $\mathcal {R}$. These findings are also supported by experiments with the software system InfOCF that employs the proposed compilation scheme. Conditional Conditional knowledge base c-representation Skeptical c-inference Weakly skeptical c-inference Credulous c-inference Constraint satisfaction problem Knowledge base compilation Knowledge base modification Incremental compilation Kutsch, Steven aut Sauerwald, Kai aut Enthalten in Annals of mathematics and artificial intelligence Springer International Publishing, 1990 87(2019), 1-2 vom: 30. Aug., Seite 5-41 (DE-627)130904104 (DE-600)1045926-1 (DE-576)02499622X 1012-2443 nnns volume:87 year:2019 number:1-2 day:30 month:08 pages:5-41 https://doi.org/10.1007/s10472-019-09653-7 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 AR 87 2019 1-2 30 08 5-41 |
language |
English |
source |
Enthalten in Annals of mathematics and artificial intelligence 87(2019), 1-2 vom: 30. Aug., Seite 5-41 volume:87 year:2019 number:1-2 day:30 month:08 pages:5-41 |
sourceStr |
Enthalten in Annals of mathematics and artificial intelligence 87(2019), 1-2 vom: 30. Aug., Seite 5-41 volume:87 year:2019 number:1-2 day:30 month:08 pages:5-41 |
format_phy_str_mv |
Article |
institution |
findex.gbv.de |
topic_facet |
Conditional Conditional knowledge base c-representation Skeptical c-inference Weakly skeptical c-inference Credulous c-inference Constraint satisfaction problem Knowledge base compilation Knowledge base modification Incremental compilation |
dewey-raw |
510 |
isfreeaccess_bool |
false |
container_title |
Annals of mathematics and artificial intelligence |
authorswithroles_txt_mv |
Beierle, Christoph @@aut@@ Kutsch, Steven @@aut@@ Sauerwald, Kai @@aut@@ |
publishDateDaySort_date |
2019-08-30T00:00:00Z |
hierarchy_top_id |
130904104 |
dewey-sort |
3510 |
id |
OLC2041508329 |
language_de |
englisch |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2041508329</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502200419.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2019 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10472-019-09653-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2041508329</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10472-019-09653-7-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">17,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Beierle, Christoph</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Nature Switzerland AG 2019</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Several different semantics have been proposed for conditional knowledge bases $\mathcal {R}$ containing qualitative conditionals of the form “If A, then usually B”, leading to different nonmonotonic inference relations induced by $\mathcal {R}$. For the notion of c-representations which are a subclass of all ranking functions accepting $\mathcal {R}$, a skeptical inference relation, called c-inference and taking all c-representations of $\mathcal {R}$ into account, has been suggested. In this article, we develop a 3-phase compilation scheme for both knowledge bases and skeptical queries to constraint satisfaction problems. In addition to skeptical c-inference, we show how also credulous and weakly skeptical c-inference can be modelled as constraint satisfaction problems, and that the compilation scheme can be extended to such queries. We further extend the compilation approach to knowledge bases evolving over time. The compiled form of $\mathcal {R}$ is reused for incrementally compiling extensions, contractions, and updates of $\mathcal {R}$. For each compilation step, we prove its soundness and completeness, and demonstrate significant efficiency benefits when querying the compiled version of $\mathcal {R}$. These findings are also supported by experiments with the software system InfOCF that employs the proposed compilation scheme.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Conditional</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Conditional knowledge base</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">c-representation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Skeptical c-inference</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Weakly skeptical c-inference</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Credulous c-inference</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constraint satisfaction problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Knowledge base compilation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Knowledge base modification</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Incremental compilation</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kutsch, Steven</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sauerwald, Kai</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of mathematics and artificial intelligence</subfield><subfield code="d">Springer International Publishing, 1990</subfield><subfield code="g">87(2019), 1-2 vom: 30. Aug., Seite 5-41</subfield><subfield code="w">(DE-627)130904104</subfield><subfield code="w">(DE-600)1045926-1</subfield><subfield code="w">(DE-576)02499622X</subfield><subfield code="x">1012-2443</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:87</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:1-2</subfield><subfield code="g">day:30</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:5-41</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10472-019-09653-7</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">87</subfield><subfield code="j">2019</subfield><subfield code="e">1-2</subfield><subfield code="b">30</subfield><subfield code="c">08</subfield><subfield code="h">5-41</subfield></datafield></record></collection>
|
author |
Beierle, Christoph |
spellingShingle |
Beierle, Christoph ddc 510 ssgn 17,1 misc Conditional misc Conditional knowledge base misc c-representation misc Skeptical c-inference misc Weakly skeptical c-inference misc Credulous c-inference misc Constraint satisfaction problem misc Knowledge base compilation misc Knowledge base modification misc Incremental compilation Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations |
authorStr |
Beierle, Christoph |
ppnlink_with_tag_str_mv |
@@773@@(DE-627)130904104 |
format |
Article |
dewey-ones |
510 - Mathematics 004 - Data processing & computer science |
delete_txt_mv |
keep |
author_role |
aut aut aut |
collection |
OLC |
remote_str |
false |
illustrated |
Not Illustrated |
issn |
1012-2443 |
topic_title |
510 004 VZ 17,1 ssgn Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations Conditional Conditional knowledge base c-representation Skeptical c-inference Weakly skeptical c-inference Credulous c-inference Constraint satisfaction problem Knowledge base compilation Knowledge base modification Incremental compilation |
topic |
ddc 510 ssgn 17,1 misc Conditional misc Conditional knowledge base misc c-representation misc Skeptical c-inference misc Weakly skeptical c-inference misc Credulous c-inference misc Constraint satisfaction problem misc Knowledge base compilation misc Knowledge base modification misc Incremental compilation |
topic_unstemmed |
ddc 510 ssgn 17,1 misc Conditional misc Conditional knowledge base misc c-representation misc Skeptical c-inference misc Weakly skeptical c-inference misc Credulous c-inference misc Constraint satisfaction problem misc Knowledge base compilation misc Knowledge base modification misc Incremental compilation |
topic_browse |
ddc 510 ssgn 17,1 misc Conditional misc Conditional knowledge base misc c-representation misc Skeptical c-inference misc Weakly skeptical c-inference misc Credulous c-inference misc Constraint satisfaction problem misc Knowledge base compilation misc Knowledge base modification misc Incremental compilation |
format_facet |
Aufsätze Gedruckte Aufsätze |
format_main_str_mv |
Text Zeitschrift/Artikel |
carriertype_str_mv |
nc |
hierarchy_parent_title |
Annals of mathematics and artificial intelligence |
hierarchy_parent_id |
130904104 |
dewey-tens |
510 - Mathematics 000 - Computer science, knowledge & systems |
hierarchy_top_title |
Annals of mathematics and artificial intelligence |
isfreeaccess_txt |
false |
familylinks_str_mv |
(DE-627)130904104 (DE-600)1045926-1 (DE-576)02499622X |
title |
Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations |
ctrlnum |
(DE-627)OLC2041508329 (DE-He213)s10472-019-09653-7-p |
title_full |
Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations |
author_sort |
Beierle, Christoph |
journal |
Annals of mathematics and artificial intelligence |
journalStr |
Annals of mathematics and artificial intelligence |
lang_code |
eng |
isOA_bool |
false |
dewey-hundreds |
500 - Science 000 - Computer science, information & general works |
recordtype |
marc |
publishDateSort |
2019 |
contenttype_str_mv |
txt |
container_start_page |
5 |
author_browse |
Beierle, Christoph Kutsch, Steven Sauerwald, Kai |
container_volume |
87 |
class |
510 004 VZ 17,1 ssgn |
format_se |
Aufsätze |
author-letter |
Beierle, Christoph |
doi_str_mv |
10.1007/s10472-019-09653-7 |
dewey-full |
510 004 |
title_sort |
compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations |
title_auth |
Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations |
abstract |
Abstract Several different semantics have been proposed for conditional knowledge bases $\mathcal {R}$ containing qualitative conditionals of the form “If A, then usually B”, leading to different nonmonotonic inference relations induced by $\mathcal {R}$. For the notion of c-representations which are a subclass of all ranking functions accepting $\mathcal {R}$, a skeptical inference relation, called c-inference and taking all c-representations of $\mathcal {R}$ into account, has been suggested. In this article, we develop a 3-phase compilation scheme for both knowledge bases and skeptical queries to constraint satisfaction problems. In addition to skeptical c-inference, we show how also credulous and weakly skeptical c-inference can be modelled as constraint satisfaction problems, and that the compilation scheme can be extended to such queries. We further extend the compilation approach to knowledge bases evolving over time. The compiled form of $\mathcal {R}$ is reused for incrementally compiling extensions, contractions, and updates of $\mathcal {R}$. For each compilation step, we prove its soundness and completeness, and demonstrate significant efficiency benefits when querying the compiled version of $\mathcal {R}$. These findings are also supported by experiments with the software system InfOCF that employs the proposed compilation scheme. © Springer Nature Switzerland AG 2019 |
abstractGer |
Abstract Several different semantics have been proposed for conditional knowledge bases $\mathcal {R}$ containing qualitative conditionals of the form “If A, then usually B”, leading to different nonmonotonic inference relations induced by $\mathcal {R}$. For the notion of c-representations which are a subclass of all ranking functions accepting $\mathcal {R}$, a skeptical inference relation, called c-inference and taking all c-representations of $\mathcal {R}$ into account, has been suggested. In this article, we develop a 3-phase compilation scheme for both knowledge bases and skeptical queries to constraint satisfaction problems. In addition to skeptical c-inference, we show how also credulous and weakly skeptical c-inference can be modelled as constraint satisfaction problems, and that the compilation scheme can be extended to such queries. We further extend the compilation approach to knowledge bases evolving over time. The compiled form of $\mathcal {R}$ is reused for incrementally compiling extensions, contractions, and updates of $\mathcal {R}$. For each compilation step, we prove its soundness and completeness, and demonstrate significant efficiency benefits when querying the compiled version of $\mathcal {R}$. These findings are also supported by experiments with the software system InfOCF that employs the proposed compilation scheme. © Springer Nature Switzerland AG 2019 |
abstract_unstemmed |
Abstract Several different semantics have been proposed for conditional knowledge bases $\mathcal {R}$ containing qualitative conditionals of the form “If A, then usually B”, leading to different nonmonotonic inference relations induced by $\mathcal {R}$. For the notion of c-representations which are a subclass of all ranking functions accepting $\mathcal {R}$, a skeptical inference relation, called c-inference and taking all c-representations of $\mathcal {R}$ into account, has been suggested. In this article, we develop a 3-phase compilation scheme for both knowledge bases and skeptical queries to constraint satisfaction problems. In addition to skeptical c-inference, we show how also credulous and weakly skeptical c-inference can be modelled as constraint satisfaction problems, and that the compilation scheme can be extended to such queries. We further extend the compilation approach to knowledge bases evolving over time. The compiled form of $\mathcal {R}$ is reused for incrementally compiling extensions, contractions, and updates of $\mathcal {R}$. For each compilation step, we prove its soundness and completeness, and demonstrate significant efficiency benefits when querying the compiled version of $\mathcal {R}$. These findings are also supported by experiments with the software system InfOCF that employs the proposed compilation scheme. © Springer Nature Switzerland AG 2019 |
collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OPC-MAT GBV_ILN_70 |
container_issue |
1-2 |
title_short |
Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations |
url |
https://doi.org/10.1007/s10472-019-09653-7 |
remote_bool |
false |
author2 |
Kutsch, Steven Sauerwald, Kai |
author2Str |
Kutsch, Steven Sauerwald, Kai |
ppnlink |
130904104 |
mediatype_str_mv |
n |
isOA_txt |
false |
hochschulschrift_bool |
false |
doi_str |
10.1007/s10472-019-09653-7 |
up_date |
2024-07-04T04:54:33.292Z |
_version_ |
1803622938872643584 |
fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2041508329</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230502200419.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200820s2019 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/s10472-019-09653-7</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2041508329</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)s10472-019-09653-7-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">510</subfield><subfield code="a">004</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">17,1</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Beierle, Christoph</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Compilation of static and evolving conditional knowledge bases for computing induced nonmonotonic inference relations</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2019</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Springer Nature Switzerland AG 2019</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract Several different semantics have been proposed for conditional knowledge bases $\mathcal {R}$ containing qualitative conditionals of the form “If A, then usually B”, leading to different nonmonotonic inference relations induced by $\mathcal {R}$. For the notion of c-representations which are a subclass of all ranking functions accepting $\mathcal {R}$, a skeptical inference relation, called c-inference and taking all c-representations of $\mathcal {R}$ into account, has been suggested. In this article, we develop a 3-phase compilation scheme for both knowledge bases and skeptical queries to constraint satisfaction problems. In addition to skeptical c-inference, we show how also credulous and weakly skeptical c-inference can be modelled as constraint satisfaction problems, and that the compilation scheme can be extended to such queries. We further extend the compilation approach to knowledge bases evolving over time. The compiled form of $\mathcal {R}$ is reused for incrementally compiling extensions, contractions, and updates of $\mathcal {R}$. For each compilation step, we prove its soundness and completeness, and demonstrate significant efficiency benefits when querying the compiled version of $\mathcal {R}$. These findings are also supported by experiments with the software system InfOCF that employs the proposed compilation scheme.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Conditional</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Conditional knowledge base</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">c-representation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Skeptical c-inference</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Weakly skeptical c-inference</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Credulous c-inference</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Constraint satisfaction problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Knowledge base compilation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Knowledge base modification</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Incremental compilation</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Kutsch, Steven</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Sauerwald, Kai</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">Annals of mathematics and artificial intelligence</subfield><subfield code="d">Springer International Publishing, 1990</subfield><subfield code="g">87(2019), 1-2 vom: 30. Aug., Seite 5-41</subfield><subfield code="w">(DE-627)130904104</subfield><subfield code="w">(DE-600)1045926-1</subfield><subfield code="w">(DE-576)02499622X</subfield><subfield code="x">1012-2443</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:87</subfield><subfield code="g">year:2019</subfield><subfield code="g">number:1-2</subfield><subfield code="g">day:30</subfield><subfield code="g">month:08</subfield><subfield code="g">pages:5-41</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/s10472-019-09653-7</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">87</subfield><subfield code="j">2019</subfield><subfield code="e">1-2</subfield><subfield code="b">30</subfield><subfield code="c">08</subfield><subfield code="h">5-41</subfield></datafield></record></collection>
|
score |
7.3999014 |