International Center for Computational Logic - Benutzerbeiträge [de]

Inproceedings3344

2022-11-04T07:28:57Z

Faiq Miftakhul Falakh:

{{Publikation Erster Autor
|ErsterAutorVorname=Faiq Miftakhul
|ErsterAutorNachname=Falakh
|FurtherAuthors=Sebastian Rudolph
}}
{{Inproceedings
|Referiert=1
|Title=AGM Revision in Description Logics under Fixed-Domain Semantics
|To appear=0
|Year=2022
|Month=August
|Booktitle=Proceedings of the 35th International Workshop on Description Logics (DL 2022)
|Publisher=CEUR Workshop Proceedings
|Editor=Ofer Arieli, Martin Homola, Jean Christoph Jung, Marie-Laure Mugnier
}}
{{Publikation Details
|Abstract=While semantic approaches for revising knowledge bases are fine-grained and independent of the syntactical forms, they are unable to be straightforwardly applied to description logics (DLs) under standard semantics. In this paper, we present a characterization of revision for (finite) knowledge bases in DLs under the fixed-domain semantics, where the domain is fixed and finite. We also introduce an instantiation of a model-based revision operator which satisfies all standard postulates using the notion of distance between interpretations. The model set of the revision result is shown to be expressible in a KB in our setting. In addition, by weakening the KB based on certain domain elements, an individual-based revision operator is provided as an alternative approach.
|Download=DL22-Falakh-Rudolph-camera-ready.pdf
|Link=http://star.informatik.rwth-aachen.de/Publications/CEUR-WS/Vol-3263/paper-8.pdf
|Projekt=ScaDS.AI
|Forschungsgruppe=Computational Logic
}}

Inproceedings3345

2022-09-12T11:49:56Z

Faiq Miftakhul Falakh:

{{Publikation Erster Autor
|ErsterAutorVorname=Faiq Miftakhul
|ErsterAutorNachname=Falakh
|FurtherAuthors=Sebastian Rudolph; Kai Sauerwald
}}
{{Inproceedings
|Referiert=1
|Title=Semantic Characterizations of AGM Revision for Tarskian Logics
|To appear=1
|Year=2022
|Month=September
|Booktitle=Proceedings of the 6th International Joint Conference on Rules and Reasoning (RuleML+RR 2022)
|Publisher=Springer
}}
{{Publikation Details
|Abstract=Given the increasingly dynamic nature of knowledge in the era of Web-based information exchange, techniques to revise recorded knowledge – such as knowledge graphs or ontologies – with respect to new findings are more important than ever. For knowledge representation approaches based on formal logics, the AGM belief revision postulates by Alchourrón, Gärdenfors, and Makinson continue to represent a cornerstone in research related to belief change. Katsuno and Mendelzon (K&M) adopted the AGM postulates for changing belief bases and characterized AGM belief base revision in propositional logic over finite signatures.
We generalize K&M's approach to (multiple) base revision in arbitrary Tarskian logics, covering all logics with a classical model-theoretic semantics and hence a wide variety of logics used in knowledge representation and beyond. Our generic formulation applies to various notions of “base”; such as belief sets, arbitrary or finite sets of sentences, or single sentences.
The core result is a representation theorem showing a two-way correspondence between AGM base revision operators and certain “assignments”: functions mapping belief bases to total — yet not transitive — “preference” relations between interpretations. We also provide a characterization of all Tarskian logics for which our result can be strengthened to assignments producing transitive preference relations as in K&M’s original work.
|Download=RuleML+RR22-FalakhRudolphSauerwald.pdf
|Projekt=ScaDS.AI
|Forschungsgruppe=Computational Logic
}}

Faiq Miftakhul Falakh

2022-09-10T08:55:35Z

Faiq Miftakhul Falakh:

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Forschungsgruppe=Computational Logic
|Stellung=Doktorand
|Ehemaliger=0
|Email=faiq_miftakhul.falakh@tu-dresden.de
|Raum=APB 2031
|Bild=Faiq-400x600.jpg
|Info=Since October 2017, I am a doctoral student in [[Computational Logic/en|Computational Logic Group]] led by [[Sebastian_Rudolph/en|Prof. Dr. Sebastian Rudolph]]. My research topic is about belief change and knowledge base revision. My study is supported by the Indonesia Endowment Fund for Education ([https://www.lpdp.kemenkeu.go.id/ LPDP scholarship]) from the Indonesia government and by the Federal Ministry of Education and Research, Germany (BMBF) in the Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI)
|Info EN=Since October 2017, I am a doctoral student in [[Computational Logic/en|Computational Logic Group]] led by [[Sebastian_Rudolph/en|Prof. Dr. Sebastian Rudolph]]. My research topic is about belief change and knowledge base revision. My study is supported by the Indonesia Endowment Fund for Education ([https://www.lpdp.kemenkeu.go.id/ LPDP scholarship]) from the Indonesia government and by the Federal Ministry of Education and Research, Germany (BMBF) in the Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI)
|DBLP=https://dblp.org/pid/203/8236.html
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}

Inproceedings3345

2022-09-09T20:46:26Z

Faiq Miftakhul Falakh:

{{Publikation Erster Autor
|ErsterAutorVorname=Faiq Miftakhul
|ErsterAutorNachname=Falakh
|FurtherAuthors=Sebastian Rudolph; Kai Sauerwald
}}
{{Inproceedings
|Referiert=1
|Title=Semantic Characterizations of AGM Revision for Tarskian Logics
|To appear=1
|Year=2022
|Month=September
|Booktitle=Proceddings of the 6th International Joint Conference on Rules and Reasoning (RuleML+RR 2022)
|Publisher=Springer
}}
{{Publikation Details
|Abstract=Given the increasingly dynamic nature of knowledge in the era of Web-based information exchange, techniques to revise recorded knowledge – such as knowledge graphs or ontologies – with respect to new findings are more important than ever. For knowledge representation approaches based on formal logics, the AGM belief revision postulates by Alchourrón, Gärdenfors, and Makinson continue to represent a cornerstone in research related to belief change. Katsuno and Mendelzon (K&M) adopted the AGM postulates for changing belief bases and characterized AGM belief base revision in propositional logic over finite signatures.
We generalize K&M's approach to (multiple) base revision in arbitrary Tarskian logics, covering all logics with a classical model-theoretic semantics and hence a wide variety of logics used in knowledge representation and beyond. Our generic formulation applies to various notions of “base”; such as belief sets, arbitrary or finite sets of sentences, or single sentences.
The core result is a representation theorem showing a two-way correspondence between AGM base revision operators and certain “assignments”: functions mapping belief bases to total — yet not transitive — “preference” relations between interpretations. We also provide a characterization of all Tarskian logics for which our result can be strengthened to assignments producing transitive preference relations as in K&M’s original work.
|Download=RuleML+RR22-FalakhRudolphSauerwald.pdf
|Projekt=ScaDS.AI
|Forschungsgruppe=Computational Logic
}}

Faiq Miftakhul Falakh

2022-09-09T20:33:24Z

Faiq Miftakhul Falakh:

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Forschungsgruppe=Computational Logic
|Stellung=Wissenschaftlicher Mitarbeiter
|Ehemaliger=0
|Email=faiq_miftakhul.falakh@tu-dresden.de
|Raum=APB 2031
|Bild=Faiq-400x600.jpg
|Info=Since October 2017, I am a doctoral student in [[Computational Logic/en|Computational Logic Group]] led by [[Sebastian_Rudolph/en|Prof. Dr. Sebastian Rudolph]]. My research topic is about belief change and knowledge base revision. My study is supported by the Indonesia Endowment Fund for Education ([https://www.lpdp.kemenkeu.go.id/ LPDP scholarship]) from the Indonesia government and by the Federal Ministry of Education and Research, Germany (BMBF) in the Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI)
|Info EN=Since October 2017, I am a doctoral student in [[Computational Logic/en|Computational Logic Group]] led by [[Sebastian_Rudolph/en|Prof. Dr. Sebastian Rudolph]]. My research topic is about belief change and knowledge base revision. My study is supported by the Indonesia Endowment Fund for Education ([https://www.lpdp.kemenkeu.go.id/ LPDP scholarship]) from the Indonesia government and by the Federal Ministry of Education and Research, Germany (BMBF) in the Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI)
|DBLP=https://dblp.org/pid/203/8236.html
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}

Inproceedings3345

2022-09-09T20:29:39Z

Faiq Miftakhul Falakh:

{{Publikation Erster Autor
|ErsterAutorVorname=Faiq Miftakhul
|ErsterAutorNachname=Falakh
|FurtherAuthors=Sebastian Rudolph; Kai Sauerwald
}}
{{Inproceedings
|Referiert=1
|Title=Semantic Characterizations of AGM Revision for Tarskian Logics
|To appear=1
|Year=2022
|Month=September
|Booktitle=Rules and Reasoning - 6th International Joint Conference, RuleML+RR 2022, Berlin (Virtual), September 26-28, 2022, Proceedings
|Publisher=Springer
}}
{{Publikation Details
|Abstract=Given the increasingly dynamic nature of knowledge in the era of Web-based information exchange, techniques to revise recorded knowledge – such as knowledge graphs or ontologies – with respect to new findings are more important than ever. For knowledge representation approaches based on formal logics, the AGM belief revision postulates by Alchourrón, Gärdenfors, and Makinson continue to represent a cornerstone in research related to belief change. Katsuno and Mendelzon (K&M) adopted the AGM postulates for changing belief bases and characterized AGM belief base revision in propositional logic over finite signatures.
We generalize K&M's approach to (multiple) base revision in arbitrary Tarskian logics, covering all logics with a classical model-theoretic semantics and hence a wide variety of logics used in knowledge representation and beyond. Our generic formulation applies to various notions of “base”; such as belief sets, arbitrary or finite sets of sentences, or single sentences.
The core result is a representation theorem showing a two-way correspondence between AGM base revision operators and certain “assignments”: functions mapping belief bases to total — yet not transitive — “preference” relations between interpretations. We also provide a characterization of all Tarskian logics for which our result can be strengthened to assignments producing transitive preference relations as in K&M’s original work.
|Download=RuleML+RR22-FalakhRudolphSauerwald.pdf
|Projekt=ScaDS.AI
|Forschungsgruppe=Computational Logic
}}

Inproceedings3345

2022-09-09T20:27:42Z

Faiq Miftakhul Falakh:

{{Publikation Erster Autor
|ErsterAutorVorname=Faiq Miftakhul
|ErsterAutorNachname=Falakh
|FurtherAuthors=Sebastian Rudolph; Kai Sauerwald
}}
{{Inproceedings
|Referiert=1
|Title=Semantic Characterizations of AGM Revision for Tarskian Logics
|To appear=1
|Year=2022
|Month=September
|Booktitle=Rules and Reasoning - 6th International Joint Conference, RuleML+RR 2021, Berlin (Virtual), September 26-28, 2022, Proceedings
|Publisher=Springer
}}
{{Publikation Details
|Abstract=Given the increasingly dynamic nature of knowledge in the era of Web-based information exchange, techniques to revise recorded knowledge – such as knowledge graphs or ontologies – with respect to new findings are more important than ever. For knowledge representation approaches based on formal logics, the AGM belief revision postulates by Alchourrón, Gärdenfors, and Makinson continue to represent a cornerstone in research related to belief change. Katsuno and Mendelzon (K&M) adopted the AGM postulates for changing belief bases and characterized AGM belief base revision in propositional logic over finite signatures.
We generalize K&M's approach to (multiple) base revision in arbitrary Tarskian logics, covering all logics with a classical model-theoretic semantics and hence a wide variety of logics used in knowledge representation and beyond. Our generic formulation applies to various notions of “base”; such as belief sets, arbitrary or finite sets of sentences, or single sentences.
The core result is a representation theorem showing a two-way correspondence between AGM base revision operators and certain “assignments”: functions mapping belief bases to total — yet not transitive — “preference” relations between interpretations. We also provide a characterization of all Tarskian logics for which our result can be strengthened to assignments producing transitive preference relations as in K&M’s original work.
|Download=RuleML+RR22-FalakhRudolphSauerwald.pdf
|Projekt=ScaDS.AI
|Forschungsgruppe=Computational Logic
}}

Inproceedings3345

2022-09-09T20:25:51Z

Faiq Miftakhul Falakh:

{{Publikation Erster Autor
|ErsterAutorVorname=Faiq Miftakhul
|ErsterAutorNachname=Falakh
|FurtherAuthors=Sebastian Rudolph; Kai Sauerwald
}}
{{Inproceedings
|Referiert=1
|Title=Semantic Characterizations of AGM Revision for Tarskian Logics
|To appear=1
|Year=2022
|Month=September
|Booktitle=Rules and Reasoning - 6th International Joint Conference, RuleML+RR 2021, Berlin (Virtual), September 26-28, 2022, Proceedings
|Publisher=Springer
}}
{{Publikation Details
|Abstract=Given the increasingly dynamic nature of knowledge in the era of Web-based information exchange, techniques to revise recorded knowledge – such as knowledge graphs or ontologies – with respect to new findings are more important than ever. For knowledge representation approaches based on formal logics, the AGM belief revision postulates by Alchourrón, Gärdenfors, and Makinson continue to represent a cornerstone in research related to belief change. Katsuno and Mendelzon (K&M) adopted the AGM postulates for changing belief bases and characterized AGM belief base revision in propositional logic over finite signatures.
We generalize K&M's approach to (multiple) base revision in arbitrary Tarskian logics, covering all logics with a classical model-theoretic semantics and hence a wide variety of logics used in knowledge representation and beyond. Our generic formulation applies to various notions of “base”; such as belief sets, arbitrary or finite sets of sentences, or single sentences.
The core result is a representation theorem showing a two-way correspondence between AGM base revision operators and certain “assignments”: functions mapping belief bases to total — yet not transitive — “preference” relations between interpretations. We also provide a characterization of all Tarskian logics for which our result can be strengthened to assignments producing transitive preference relations as in K&M’s original work.
|Download=RuleML+RR22-FalakhRudolphSauerwald.pdf
|Projekt=ScaDS.AI
|Forschungsgruppe=Computational Logic
}}

Inproceedings3345/en

2022-09-09T20:25:33Z

Faiq Miftakhul Falakh: Page created automatically by parser function on page Inproceedings3345

#REDIRECT [[Inproceedings3345]]

Inproceedings3345

2022-09-09T20:25:32Z

Faiq Miftakhul Falakh: Die Seite wurde neu angelegt: „{{Publikation Erster Autor |ErsterAutorVorname=Faiq Miftakhul |ErsterAutorNachname=Falakh |FurtherAuthors=Sebastian Rudolph }} {{Inproceedings |Referiert=1 |Ti…“

{{Publikation Erster Autor
|ErsterAutorVorname=Faiq Miftakhul
|ErsterAutorNachname=Falakh
|FurtherAuthors=Sebastian Rudolph
}}
{{Inproceedings
|Referiert=1
|Title=Semantic Characterizations of AGM Revision for Tarskian Logics
|To appear=1
|Year=2022
|Month=September
|Booktitle=Rules and Reasoning - 6th International Joint Conference, RuleML+RR 2021, Berlin (Virtual), September 26-28, 2022, Proceedings
|Publisher=Springer
}}
{{Publikation Details
|Abstract=Given the increasingly dynamic nature of knowledge in the era of Web-based information exchange, techniques to revise recorded knowledge – such as knowledge graphs or ontologies – with respect to new findings are more important than ever. For knowledge representation approaches based on formal logics, the AGM belief revision postulates by Alchourrón, Gärdenfors, and Makinson continue to represent a cornerstone in research related to belief change. Katsuno and Mendelzon (K&M) adopted the AGM postulates for changing belief bases and characterized AGM belief base revision in propositional logic over finite signatures.
We generalize K&M's approach to (multiple) base revision in arbitrary Tarskian logics, covering all logics with a classical model-theoretic semantics and hence a wide variety of logics used in knowledge representation and beyond. Our generic formulation applies to various notions of “base”; such as belief sets, arbitrary or finite sets of sentences, or single sentences.
The core result is a representation theorem showing a two-way correspondence between AGM base revision operators and certain “assignments”: functions mapping belief bases to total — yet not transitive — “preference” relations between interpretations. We also provide a characterization of all Tarskian logics for which our result can be strengthened to assignments producing transitive preference relations as in K&M’s original work.
|Download=RuleML+RR22-FalakhRudolphSauerwald.pdf
|Projekt=ScaDS.AI
|Forschungsgruppe=Computational Logic
}}

Datei:RuleML+RR22-FalakhRudolphSauerwald.pdf

2022-09-09T20:25:18Z

Faiq Miftakhul Falakh:

Inproceedings3344

2022-09-09T20:04:21Z

Faiq Miftakhul Falakh:

{{Publikation Erster Autor
|ErsterAutorVorname=Faiq Miftakhul
|ErsterAutorNachname=Falakh
|FurtherAuthors=Sebastian Rudolph
}}
{{Inproceedings
|Referiert=1
|Title=AGM Revision in Description Logics under Fixed-Domain Semantics
|To appear=1
|Year=2022
|Month=August
|Booktitle=Proceedings of the 35th International Workshop on Description Logics (DL 2022)
|Publisher=CEUR Workshop Proceedings
|Editor=Ofer Arieli, Martin Homola, Jean Christoph Jung, Marie-Laure Mugnier
}}
{{Publikation Details
|Abstract=While semantic approaches for revising knowledge bases are fine-grained and independent of the syntactical forms, they are unable to be straightforwardly applied to description logics (DLs) under standard semantics. In this paper, we present a characterization of revision for (finite) knowledge bases in DLs under the fixed-domain semantics, where the domain is fixed and finite. We also introduce an instantiation of a model-based revision operator which satisfies all standard postulates using the notion of distance between interpretations. The model set of the revision result is shown to be expressible in a KB in our setting. In addition, by weakening the KB based on certain domain elements, an individual-based revision operator is provided as an alternative approach.
|Download=DL22-Falakh-Rudolph-camera-ready.pdf
|Projekt=ScaDS.AI
|Forschungsgruppe=Computational Logic
}}

Inproceedings3344/en

2022-09-09T20:02:33Z

Faiq Miftakhul Falakh: Page created automatically by parser function on page Inproceedings3344

#REDIRECT [[Inproceedings3344]]

Inproceedings3344

2022-09-09T20:02:33Z

{{Publikation Erster Autor
|ErsterAutorVorname=Faiq Miftakhul
|ErsterAutorNachname=Falakh
|FurtherAuthors=Sebastian Rudolph
}}
{{Inproceedings
|Referiert=1
|Title=AGM Revision in Description Logics under Fixed-Domain Semantics
|To appear=1
|Year=2022
|Month=August
|Booktitle=Proceedings of the 35th International Workshop on Description Logics (DL 2022)
|Publisher=CEUR Workshop Proceedings
|Editor=Ofer Arieli, Martin Homola, Jean Christoph Jung, Marie-Laure Mugnier
}}
{{Publikation Details
|Abstract=While semantic approaches for revising knowledge bases are fine-grained and independent of the syntactical forms, they are unable to be straightforwardly applied to description logics (DLs) under standard semantics. In this paper, we present a characterization of revision for (finite) knowledge bases in DLs under the fixed-domain semantics, where the domain is fixed and finite. We also introduce an instantiation of a model-based revision operator which satisfies all standard postulates using the notion of distance between interpretations. The model set of the revision result is shown to be expressible in a KB in our setting. In addition, by weakening the KB based on certain domain elements, an individual-based revision operator is provided as an alternative approach.
|Download=DL22-Falakh-Rudolph.pdf
|Projekt=ScaDS.AI
|Forschungsgruppe=Computational Logic
}}

Datei:DL22-Falakh-Rudolph-camera-ready.pdf

2022-09-09T20:01:27Z

Faiq Miftakhul Falakh:

Faiq Miftakhul Falakh

2022-09-09T19:52:24Z

Faiq Miftakhul Falakh:

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Forschungsgruppe=Computational Logic
|Stellung=Stipendiat
|Ehemaliger=0
|Telefon=+49 351 463 43558
|Email=faiq_miftakhul.falakh@tu-dresden.de
|Raum=APB 2031
|Bild=Faiq-400x600.jpg
|Info=Since October 2017, I am a doctoral student in [[Computational Logic/en|Computational Logic Group]] led by [[Sebastian_Rudolph/en|Prof. Dr. Sebastian Rudolph]]. My research topic is about belief change and knowledge base revision. My study is supported by the Indonesia Endowment Fund for Education ([https://www.lpdp.kemenkeu.go.id/ LPDP scholarship]) from the Indonesia government and by the Federal Ministry of Education and Research, Germany (BMBF) in the Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI)
|Info EN=Since October 2017, I am a doctoral student in [[Computational Logic/en|Computational Logic Group]] led by [[Sebastian_Rudolph/en|Prof. Dr. Sebastian Rudolph]]. My research topic is about belief change and knowledge base revision. My study is supported by the Indonesia Endowment Fund for Education ([https://www.lpdp.kemenkeu.go.id/ LPDP scholarship]) from the Indonesia government and by the Federal Ministry of Education and Research, Germany (BMBF) in the Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI)
|DBLP=https://dblp.org/pid/203/8236.html
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}

Inproceedings3343

2022-09-09T19:46:20Z

Faiq Miftakhul Falakh:

{{Publikation Erster Autor
|ErsterAutorVorname=Faiq Miftakhul
|ErsterAutorNachname=Falakh
|FurtherAuthors=Sebastian Rudolph; Kai Sauerwald
}}
{{Inproceedings
|Referiert=1
|Title=A Katsuno-Mendelzon-Style Characterization of AGM Belief Base Revision for Arbitrary Monotonic Logics (Preliminary Report)
|To appear=0
|Year=2021
|Month=September
|Booktitle=Proceedings of the 7th Workshop on Formal and Cognitive Reasoning
|Pages=48-59
|Publisher=CEUR Workshop Proceedings
|Editor=Christoph Beierle, Marco Ragni, Frieder Stolzenburg, Matthias Thimm
|Volume=2961
}}
{{Publikation Details
|Abstract=The AGM postulates by Alchourron, Gärdenfors, and Makinson continue to represent a cornerstone in research related to belief change. We generalize the approach of Katsuno and Mendelzon (KM) for characterizing AGM base revision from propositional logic to the setting of (multiple) base revision in arbitrary monotonic logics. Our core result is a representation theorem using the assignment of total – yet not transitive – "preference" relations to belief bases. We also provide a characterization of all logics for which our result can be strengthened to preorder assignments (as in KM’s original work).
|Download=Paper 5.pdf
|Link=http://ceur-ws.org/Vol-2961/paper_5.pdf
|Forschungsgruppe=Computational Logic
}}

Inproceedings3343

2022-09-09T19:39:35Z

Faiq Miftakhul Falakh:

{{Publikation Erster Autor
|ErsterAutorVorname=Faiq Miftakhul
|ErsterAutorNachname=Falakh
|FurtherAuthors=Sebastian Rudolph; Kai Sauerwald
}}
{{Inproceedings
|Referiert=1
|Title=A Katsuno-Mendelzon-Style Characterization of AGM Belief Base Revision for Arbitrary Monotonic Logics (Preliminary Report)
|To appear=0
|Year=2021
|Month=September
|Booktitle=Proceedings of the 7th Workshop on Formal and Cognitive Reasoning
|Pages=48-59
|Editor=Christoph Beierle, Marco Ragni, Frieder Stolzenburg, Matthias Thimm
|Volume=2961
}}
{{Publikation Details
|Abstract=The AGM postulates by Alchourron, Gärdenfors, and Makinson continue to represent a cornerstone in research related to belief change. We generalize the approach of Katsuno and Mendelzon (KM) for characterizing AGM base revision from propositional logic to the setting of (multiple) base revision in arbitrary monotonic logics. Our core result is a representation theorem using the assignment of total – yet not transitive – "preference" relations to belief bases. We also provide a characterization of all logics for which our result can be strengthened to preorder assignments (as in KM’s original work).
|Download=Paper 5.pdf
|Link=http://ceur-ws.org/Vol-2961/paper_5.pdf
|Forschungsgruppe=Computational Logic
}}

Inproceedings3343

2022-09-09T19:39:08Z

Faiq Miftakhul Falakh:

{{Publikation Erster Autor
|ErsterAutorVorname=Faiq Miftakhul
|ErsterAutorNachname=Falakh
|FurtherAuthors=Sebastian Rudolph, Kai Sauerwald
}}
{{Inproceedings
|Referiert=1
|Title=A Katsuno-Mendelzon-Style Characterization of AGM Belief Base Revision for Arbitrary Monotonic Logics (Preliminary Report)
|To appear=0
|Year=2021
|Month=September
|Booktitle=Proceedings of the 7th Workshop on Formal and Cognitive Reasoning
|Pages=48-59
|Editor=Christoph Beierle, Marco Ragni, Frieder Stolzenburg, Matthias Thimm
|Volume=2961
}}
{{Publikation Details
|Abstract=The AGM postulates by Alchourron, Gärdenfors, and Makinson continue to represent a cornerstone in research related to belief change. We generalize the approach of Katsuno and Mendelzon (KM) for characterizing AGM base revision from propositional logic to the setting of (multiple) base revision in arbitrary monotonic logics. Our core result is a representation theorem using the assignment of total – yet not transitive – "preference" relations to belief bases. We also provide a characterization of all logics for which our result can be strengthened to preorder assignments (as in KM’s original work).
|Download=Paper 5.pdf
|Link=http://ceur-ws.org/Vol-2961/paper_5.pdf
|Forschungsgruppe=Computational Logic
}}

Inproceedings3343/en

2022-09-09T19:37:53Z

Faiq Miftakhul Falakh: Page created automatically by parser function on page Inproceedings3343

#REDIRECT [[Inproceedings3343]]

Inproceedings3343

2022-09-09T19:37:53Z

{{Publikation Erster Autor
|ErsterAutorVorname=Faiq Miftakhul
|ErsterAutorNachname=Falakh
|FurtherAuthors=Sebastian Rudolph
}}
{{Inproceedings
|Referiert=1
|Title=A Katsuno-Mendelzon-Style Characterization of AGM Belief Base Revision for Arbitrary Monotonic Logics (Preliminary Report)
|To appear=0
|Year=2021
|Month=September
|Booktitle=Proceedings of the 7th Workshop on Formal and Cognitive Reasoning
|Pages=48-59
|Editor=Christoph Beierle, Marco Ragni, Frieder Stolzenburg, Matthias Thimm
|Volume=2961
}}
{{Publikation Details
|Abstract=The AGM postulates by Alchourron, Gärdenfors, and Makinson continue to represent a cornerstone in research related to belief change. We generalize the approach of Katsuno and Mendelzon (KM) for characterizing AGM base revision from propositional logic to the setting of (multiple) base revision in arbitrary monotonic logics. Our core result is a representation theorem using the assignment of total – yet not transitive – "preference" relations to belief bases. We also provide a characterization of all logics for which our result can be strengthened to preorder assignments (as in KM’s original work).
|Download=Paper 5.pdf
|Link=http://ceur-ws.org/Vol-2961/paper_5.pdf
|Forschungsgruppe=Computational Logic
}}

Datei:Paper 5.pdf

2022-09-09T19:18:35Z

Faiq Miftakhul Falakh:

Faiq Miftakhul Falakh

2021-10-07T08:16:11Z

Faiq Miftakhul Falakh:

Faiq Miftakhul Falakh

2021-07-21T14:23:18Z

Faiq Miftakhul Falakh:

Faiq Miftakhul Falakh

2021-07-21T14:22:08Z

Faiq Miftakhul Falakh:

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Forschungsgruppe=Computational Logic
|Stellung=Stipendiat
|Ehemaliger=0
|Telefon=+49 351 463 43558
|Email=faiq_miftakhul.falakh@tu-dresden.de
|Raum=APB 2033
|Bild=Faiq-400x600.jpg
|Info=Since October 2017, I am a doctoral student in [[Computational Logic/en|Computational Logic Group]] led by [[Sebastian_Rudolph/en|Prof. Dr. Sebastian Rudolph]]. My research topic is about Revision in Description Logic knowledge base. My study is fully supported by [https://www.lpdp.kemenkeu.go.id/ LPDP scholarship] from Indonesia government. I finished my bachelor and master degree at [https://www.cs.ui.ac.id/?lang=en Faculty of Computer Science], [https://www.ui.ac.id/en/ Universitas Indonesia].
|Info EN=Since October 2017, I am a doctoral student in [[Computational Logic/en|Computational Logic Group]] led by [[Sebastian_Rudolph/en|Prof. Dr. Sebastian Rudolph]]. My research topic is about knowledge base revision. My study is supported by [https://www.lpdp.kemenkeu.go.id/ LPDP scholarship] from Indonesia government. I finished my bachelor and master degree at [https://www.cs.ui.ac.id/?lang=en Faculty of Computer Science], [https://www.ui.ac.id/en/ Universitas Indonesia].
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}

Faiq Miftakhul Falakh

2019-07-26T09:23:21Z

Faiq Miftakhul Falakh:

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Forschungsgruppe=Computational Logic
|Stellung=Stipendiat
|Ehemaliger=0
|Telefon=+49 351 463 43558
|Email=faiq_miftakhul.falakh@tu-dresden.de
|Raum=APB 2033
|Bild=TUD 8228 hi res.jpg
|Info=Since October 2017, I am a doctoral student in [[Computational Logic/en|Computational Logic Group]] led by [[Sebastian_Rudolph/en|Prof. Dr. Sebastian Rudolph]]. My research topic is about Revision in Description Logic knowledge base. My study is fully supported by [https://www.lpdp.kemenkeu.go.id/ LPDP scholarship] from Indonesia government. I finished my bachelor and master degree at [https://www.cs.ui.ac.id/?lang=en Faculty of Computer Science], [https://www.ui.ac.id/en/ Universitas Indonesia].
|Info EN=Since October 2017, I am a doctoral student in [[Computational Logic/en|Computational Logic Group]] led by [[Sebastian_Rudolph/en|Prof. Dr. Sebastian Rudolph]]. My research topic is about Revision in Description Logic knowledge base. My study is fully supported by [https://www.lpdp.kemenkeu.go.id/ LPDP scholarship] from Indonesia government. I finished my bachelor and master degree at [https://www.cs.ui.ac.id/?lang=en Faculty of Computer Science], [https://www.ui.ac.id/en/ Universitas Indonesia].
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}

Faiq Miftakhul Falakh

2019-07-26T09:22:33Z

Faiq Miftakhul Falakh:

Faiq Miftakhul Falakh

2019-07-26T09:22:10Z

Faiq Miftakhul Falakh:

Faiq Miftakhul Falakh

2019-07-26T09:21:15Z

Faiq Miftakhul Falakh:

Faiq Miftakhul Falakh

2019-07-26T09:20:26Z

Faiq Miftakhul Falakh:

Faiq Miftakhul Falakh

2019-07-26T09:13:16Z

Faiq Miftakhul Falakh:

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Forschungsgruppe=Computational Logic
|Stellung=Stipendiat
|Ehemaliger=0
|Telefon=+49 351 463 43558
|Email=faiq_miftakhul.falakh@tu-dresden.de
|Raum=APB 2033
|Bild=TUD 8228 hi res.jpg
|Info=Since October 2017, I am a doctoral student in Computational Logic Group led by Prof. Dr. Sebastian Rudolph. My research topic is about Revision in Description Logic knowledge base. My study is fully supported by <a href="https://www.lpdp.kemenkeu.go.id/">LPDP scholarship</a> from Indonesia government. I finished my bachelor and master degree at <a href="https://www.cs.ui.ac.id/">Faculty of Computer Science</a>, <a href="https://www.ui.ac.id/en/">Universitas Indonesia</a>.
|Info EN=Since October 2017, I am a doctoral student in Computational Logic Group led by Prof. Dr. Sebastian Rudolph. My research topic is about Revision in Description Logic knowledge base. My study is fully supported by <a href="https://www.lpdp.kemenkeu.go.id/">LPDP scholarship</a> from Indonesia government. I finished my bachelor and master degree at <a href="https://www.cs.ui.ac.id/">Faculty of Computer Science</a>, <a href="https://www.ui.ac.id/en/">Universitas Indonesia</a>.
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}

Faiq Miftakhul Falakh

2019-07-26T09:06:37Z

Faiq Miftakhul Falakh:

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Forschungsgruppe=Computational Logic
|Stellung=Stipendiat
|Ehemaliger=0
|Telefon=+49 351 463 43558
|Email=faiq_miftakhul.falakh@tu-dresden.de
|Raum=APB 2033
|Bild=TUD 8228 hi res.jpg
|Info=Since October 2017, I am a doctoral student in Computational Logic Group led by Prof. Dr. Sebastian Rudolph. I am working on revision in Description Logic knowledge base. My study is fully supported by LPDP scholarship from Indonesia government. I finished my bachelor and master degree at Faculty of Computer Science, Universitas Indonesia.
|Info EN=Since October 2017, I am a doctoral student in Computational Logic Group led by Prof. Dr. Sebastian Rudolph. I am working on Revision in Description Logic knowledge base. My study is fully supported by LPDP scholarship from Indonesia government. I finished my bachelor and master degree at Faculty of Computer Science, Universitas Indonesia.
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}

Faiq Miftakhul Falakh

2019-07-26T08:50:59Z

Faiq Miftakhul Falakh:

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Forschungsgruppe=Computational Logic
|Stellung=Stipendiat
|Ehemaliger=0
|Telefon=+49 351 463 43558
|Email=faiq_miftakhul.falakh@tu-dresden.de
|Raum=APB 2033
|Bild=TUD 8228 hi res.jpg
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=0
}}

Datei:TUD 8228 hi res.jpg

2019-07-26T08:50:47Z

Faiq Miftakhul Falakh:

Faiq Miftakhul Falakh

2018-03-06T14:19:58Z

Faiq Miftakhul Falakh:

Faiq Miftakhul Falakh

2018-03-01T14:43:48Z

Faiq Miftakhul Falakh:

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Akademischer Titel=
|Forschungsgruppe=Computational Logic
|Stellung=Stipendiat
|Ehemaliger=0
|Email=faiq_miftakhul.falakh@tu-dresden.de
|Raum=APB 2033
|Bild=Ff1.jpg
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}

Faiq Miftakhul Falakh

2017-10-16T08:04:12Z

Faiq Miftakhul Falakh:

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Stipendiat
|Ehemaliger=0
|Email=faiq_miftakhul.falakh@tu-dresden.de
|Raum=APB 2033
|Bild=Ff1.jpg
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}

Datei:Ff1.jpg

2017-10-16T08:03:54Z

Faiq Miftakhul Falakh: Faiq Miftakhul Falakh lud eine neue Version von „Datei:Ff1.jpg“ hoch

Faiq Miftakhul Falakh

2017-10-16T08:02:31Z

Faiq Miftakhul Falakh:

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Stipendiat
|Ehemaliger=0
|Email=faiq_miftakhul.falakh@tu-dresden.de
|Raum=APB 2033
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}

Faiq Miftakhul Falakh

2017-10-16T08:00:55Z

Faiq Miftakhul Falakh:

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Stipendiat
|Ehemaliger=0
|Email=faiq_miftakhul.falakh@tu-dresden.de
|Raum=2033
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}

Faiq Miftakhul Falakh

2017-10-16T07:59:35Z

Faiq Miftakhul Falakh: Änderung 24251 von Faiq Miftakhul Falakh (Diskussion) rückgängig gemacht.

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Stipendiat
|Ehemaliger=0
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}

Faiq Miftakhul Falakh

2017-10-16T07:57:11Z

Faiq Miftakhul Falakh:

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Stipendiat
|Ehemaliger=0
|Email=faiq_miftakhul.falakh@tu-dresden.de
|Raum=2033
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}

Faiq Miftakhul Falakh

2017-10-16T07:54:38Z

Faiq Miftakhul Falakh:

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Stipendiat
|Ehemaliger=0
|Email=faiq_miftakhul.falakh@tu-dresden.de
|Raum=2033
|Bild=Ff1.jpg
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}

Datei:Ff1.jpg

2017-10-16T07:54:22Z

Faiq Miftakhul Falakh:

Faiq Miftakhul Falakh

2017-10-16T07:48:21Z

Faiq Miftakhul Falakh:

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Stipendiat
|Ehemaliger=0
|Email=faiq_miftakhul.falakh@tu-dresden.de
|Raum=2033
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}

Faiq Miftakhul Falakh

2017-10-16T07:47:08Z

Faiq Miftakhul Falakh:

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Stipendiat
|Ehemaliger=0
|Email=faiq_miftakhul.falakh@tu-dresden.de
|Raum=2033
|Bild=Fotofaiq.jpg
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}

Faiq Miftakhul Falakh

2017-10-16T07:46:28Z

Faiq Miftakhul Falakh:

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Stipendiat
|Ehemaliger=0
|Email=faiq_miftakhul.falakh@tu-dresden.de
|Raum=2033
|Bild=Fotofaiq 1.jpg
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}

Datei:Fotofaiq 1.jpg

2017-10-16T07:46:19Z

Faiq Miftakhul Falakh:

Faiq Miftakhul Falakh

2017-10-16T07:41:13Z

Faiq Miftakhul Falakh:

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Stipendiat
|Ehemaliger=0
|Email=faiq_miftakhul.falakh@tu-dresden.de
|Raum=2033
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}

Faiq Miftakhul Falakh

2017-10-16T07:40:16Z

Faiq Miftakhul Falakh:

{{Mitarbeiter
|Vorname=Faiq Miftakhul
|Nachname=Falakh
|Akademischer Titel=M.Sc.
|Forschungsgruppe=Computational Logic
|Stellung=Stipendiat
|Ehemaliger=0
|Email=faiq_miftakhul.falakh@tu-dresden.de
|Raum=2033
|Bild=Fotofaiq2.jpg
|Publikationen anzeigen=1
|Abschlussarbeiten anzeigen=1
}}