scadsfct | PUMA

bookmarks (hide)
display
all
bookmarks only
bookmarks per page
5
10
20
50
100
sort by
added at
title
RSS
BibTeX
XML

No matching posts.

⟨⟨
⟨
⟩
⟩⟩

publications (hide)1367
This list of posts may not be accurate to recent changes. If you want accurate posts, but with limited sorting follow this link.

display
all
publications only
publications per page
5
10
20
50
100
sort by
added at
title
author
publication date
entry type
help for advanced sorting...
RSS
BibTeX
RDF
more...

1On the expressive power of description logics with cardinality constraints on finite and infinite sets
F. Baader, and F. De Bortoli. Frontiers of Combining Systems, Springer International Publishing, Cham, (2019)
2 months ago by @scadsfct
copydeleteadd this publication to your clipboard
2Logics with Concrete Domains: First-Order Properties, Abstract Expressive Power, and (Un)Decidability
F. Baader, and F. De Bortoli. SIGAPP Appl. Comput. Rev., 24 (3): 5–17 (Oct 8, 2024)
27 days ago by @scadsfct
show all tags
imported
imported
copydeleteadd this publication to your clipboard
1Description Logics that Count, and What They Can and Cannot Count (Extended Abstract)
F. Baader, and F. De Bortoli. Proceedings of the 33rd International Workshop on Description Logics (DL'20), volume 2663 of CEUR Workshop Proceedings, Online, CEUR-WS, (2020)
2 months ago by @scadsfct
show all tags
topic_lifescience
topic_lifescience
copydeleteadd this publication to your clipboard
1Unification in the Description Logic $ELH_R^+$ without the Top Concept Modulo Cycle-Restricted Ontologies
F. Baader, and O. Fernández Gil. Automated Reasoning - 12th International Joint Conference, IJCAR 2024, Nancy, France, July 1-6, 2024, Proceedings, Part II, volume 14740 of Lecture Notes in Computer Science, page 279--297. Springer, (2024)
2 months ago by @scadsfct
copydeleteadd this publication to your clipboard
1Restricted Unification in the Description Logic $FL_\bot$
F. Baader, and O. Fernández Gil. Proceedings of the 36th International Workshop on Unification (UNIF 2022), Haifa, Israel, (2022)
2 months ago by @scadsfct
copydeleteadd this publication to your clipboard
1On the Complexity of the Small Term Reachability Problem for Terminating Term Rewriting Systems
F. Baader, and J. Giesl. 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024), volume 299 of Leibniz International Proceedings in Informatics (LIPIcs), page 16:1--16:18. Dagstuhl, Germany, Schloss Dagstuhl -- Leibniz-Zentrum für Informatik, (2024)
2 months ago by @scadsfct
copydeleteadd this publication to your clipboard
1Deciding the word problem for ground and strongly shallow identities w.R.T. Extensional symbols
F. Baader, and D. Kapur. J. Automat. Reason., 66 (3): 301--329 (August 2022)
2 months ago by @scadsfct
copydeleteadd this publication to your clipboard
1Deciding the word problem for ground identities with commutative and extensional symbols
F. Baader, and D. Kapur. Automated Reasoning, Springer International Publishing, Cham, (2020)
2 months ago by @scadsfct
copydeleteadd this publication to your clipboard
1Optimal repairs in the description logic $$EL$$ revisited
F. Baader, P. Koopmann, and F. Kriegel. Lecture Notes in Computer Science, Springer Nature Switzerland, Cham, (2023)
2 months ago by @scadsfct
copydeleteadd this publication to your clipboard
1Computing Optimal Repairs of Quantified ABoxes w.r.t. Static $EL$ TBoxes
F. Baader, P. Koopmann, F. Kriegel, and A. Nuradiansyah. Automated Deduction -- CADE 28, Springer International Publishing, Cham, (2021)
2 months ago by @scadsfct
copydeleteadd this publication to your clipboard
1Optimal ABox Repair w.r.t. Static EL TBoxes: from Quantified ABoxes back to ABoxes (Extended Version)
F. Baader, P. Koopmann, F. Kriegel, and A. Nuradiansyah. LTCS-Report, Technische Universität Dresden, (2022)
2 months ago by @scadsfct
copydeleteadd this publication to your clipboard
1Optimal ABox Repair w.r.t. Static $EL$ TBoxes: from Quantified ABoxes back to ABoxes (Extended Abstract)
F. Baader, P. Koopmann, F. Kriegel, and A. Nuradiansyah. Proceedings of the 35th International Workshop on Description Logics (DL 2022), Haifa, Israel, August 7--10, 2022, CEUR-WS.org, (2022)
2 months ago by @scadsfct
copydeleteadd this publication to your clipboard
1Efficient TBox Reasoning with Value Restrictions using the wer Reasoner
F. Baader, P. Koopmann, F. MICHEL, A. Turhan, and B. ZARRIESS. Theory and Practice of Logic Programming, (October 2021)
a month ago by @scadsfct
show all tags
imported
imported
copydeleteadd this publication to your clipboard
1Treating role assertions as first-class citizens in repair and error-tolerant reasoning
F. Baader, F. Kriegel, and A. Nuradiansyah. Proceedings of the 38th ACM/SIGAPP Symposium on Applied Computing, New York, NY, USA, ACM, (March 2023)
2 months ago by @scadsfct
copydeleteadd this publication to your clipboard
1Error-tolerant reasoning in the description logic $$EL$$ based on optimal repairs
F. Baader, F. Kriegel, and A. Nuradiansyah. Rules and Reasoning, Springer International Publishing, Cham, (2022)
2 months ago by @scadsfct
copydeleteadd this publication to your clipboard
1Error-tolerant reasoning in the description logic $EL$ based on optimal repairs
F. Baader, F. Kriegel, and A. Nuradiansyah. Rules and Reasoning, Springer International Publishing, Cham, (2022)
2 months ago by @scadsfct
copydeleteadd this publication to your clipboard
1Safety of quantified ABoxes w.r.t. singleton $\epsilon$ L policies
F. Baader, F. Kriegel, A. Nuradiansyah, and R. Peñaloza. Proceedings of the 36th Annual ACM Symposium on Applied Computing, New York, NY, USA, ACM, (March 2021)
2 months ago by @scadsfct
copydeleteadd this publication to your clipboard
1Extensions of unification modulo ACUI
F. Baader, P. Marantidis, A. Mottet, and A. Okhotin. Math. Struct. Comput. Sci., 30 (6): 597--626 (June 2020)
2 months ago by @scadsfct
copydeleteadd this publication to your clipboard
1Mixing description logics in privacy-preserving ontology publishing
F. Baader, and A. Nuradiansyah. KI 2019: Advances in Artificial Intelligence, Springer International Publishing, Cham, (2019)
2 months ago by @scadsfct
copydeleteadd this publication to your clipboard
1An algebraic view on p-admissible concrete domains for lightweight description logics
F. Baader, and J. Rydval. Logics in Artificial Intelligence, Springer International Publishing, Cham, (2021)
2 months ago by @scadsfct
copydeleteadd this publication to your clipboard

PUMA

bookmarks (hide)
display
all
bookmarks only
bookmarks per page
5
10
20
50
100
sort by
added at
title
RSS
BibTeX
XML

1On the expressive power of description logics with cardinality constraints on finite and infinite sets

2Logics with Concrete Domains: First-Order Properties, Abstract Expressive Power, and (Un)Decidability

1Description Logics that Count, and What They Can and Cannot Count (Extended Abstract)

1Unification in the Description Logic $ELH_R^+$ without the Top Concept Modulo Cycle-Restricted Ontologies

1Restricted Unification in the Description Logic $FL_\bot$

1On the Complexity of the Small Term Reachability Problem for Terminating Term Rewriting Systems

1Deciding the word problem for ground and strongly shallow identities w.R.T. Extensional symbols

1Deciding the word problem for ground identities with commutative and extensional symbols

1Optimal repairs in the description logic $$EL$$ revisited

1Computing Optimal Repairs of Quantified ABoxes w.r.t. Static $EL$ TBoxes

1Optimal ABox Repair w.r.t. Static EL TBoxes: from Quantified ABoxes back to ABoxes (Extended Version)

1Optimal ABox Repair w.r.t. Static $EL$ TBoxes: from Quantified ABoxes back to ABoxes (Extended Abstract)

1Efficient TBox Reasoning with Value Restrictions using the wer Reasoner

1Treating role assertions as first-class citizens in repair and error-tolerant reasoning

1Error-tolerant reasoning in the description logic $$EL$$ based on optimal repairs

1Error-tolerant reasoning in the description logic $EL$ based on optimal repairs

1Safety of quantified ABoxes w.r.t. singleton $\epsilon$ L policies

1Extensions of unification modulo ACUI

1Mixing description logics in privacy-preserving ontology publishing

1An algebraic view on p-admissible concrete domains for lightweight description logics

discussion

concepts

similar users

shared groups

tags

bookmarks (hide) displayallbookmarks onlybookmarks per page5102050100 sort byadded attitle RSSBibTeXXML

discussion

similar users

shared groups

tags

bookmarks (hide)
display
all
bookmarks only
bookmarks per page
5
10
20
50
100
sort by
added at
title
RSS
BibTeX
XML