article

Subsumption and implication

Author:

Georg GottlobAuthors Info & Claims

Information Processing Letters, Volume 24, Issue 2

Pages 109 - 111

https://doi.org/10.1016/0020-0190(87)90103-7

Published: 30 January 1987 Publication History

Abstract

No abstract available.

Cited By

View all

Srinivasan ABaskar ADash TShah D(2024)Composition of relational features with an application to explaining black-box predictorsMachine Language10.1007/s10994-023-06399-6113:3(1091-1132)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1007/s10994-023-06399-6
Bromberger MLeutgeb LWeidenbach C(2022)An Efficient Subsumption Test Pipeline for BS(LRA) ClausesAutomated Reasoning10.1007/978-3-031-10769-6_10(147-168)Online publication date: 8-Aug-2022
https://dl.acm.org/doi/10.1007/978-3-031-10769-6_10
Seiffarth FHorváth TWrobel S(2019)Maximal Closed Set and Half-Space Separations in Finite Closure SystemsMachine Learning and Knowledge Discovery in Databases10.1007/978-3-030-46150-8_2(21-37)Online publication date: 16-Sep-2019
https://dl.acm.org/doi/10.1007/978-3-030-46150-8_2
Show More Cited By

Index Terms

Subsumption and implication
1. Theory of computation
  1. Logic
  2. Models of computation
    1. Computability

Recommendations

Inverse subsumption for complete explanatory induction

Modern explanatory inductive logic programming methods like Progol, Residue procedure, CF-induction, HAIL and Imparo use the principle of inverse entailment (IE). Those IE-based methods commonly compute a hypothesis in two steps: by first constructing ...
Larisa Maksimova on Implication, Interpolation, and Definability
Logic-based subsumption architecture
IJCAI'99: Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1

We describe a logic-based AI architecture based on Brooks' subsumption architecture. In this architecture, we axiomatize different layers of control in First-Order Logic (FOL) and use independent theorem provers to derive each layer's outputs given its ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Information Processing Letters Volume 24, Issue 2

January 1987

61 pages

ISSN:0020-0190

Editor:
A. V. Aho
AT&T Bell Laboratories, Murray Hill, NJ

Issue’s Table of Contents

Publisher

Elsevier North-Holland, Inc.

United States

Publication History

Published: 30 January 1987

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

26
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 20 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Srinivasan ABaskar ADash TShah D(2024)Composition of relational features with an application to explaining black-box predictorsMachine Language10.1007/s10994-023-06399-6113:3(1091-1132)Online publication date: 1-Mar-2024
https://dl.acm.org/doi/10.1007/s10994-023-06399-6
Bromberger MLeutgeb LWeidenbach C(2022)An Efficient Subsumption Test Pipeline for BS(LRA) ClausesAutomated Reasoning10.1007/978-3-031-10769-6_10(147-168)Online publication date: 8-Aug-2022
https://dl.acm.org/doi/10.1007/978-3-031-10769-6_10
Seiffarth FHorváth TWrobel S(2019)Maximal Closed Set and Half-Space Separations in Finite Closure SystemsMachine Learning and Knowledge Discovery in Databases10.1007/978-3-030-46150-8_2(21-37)Online publication date: 16-Sep-2019
https://dl.acm.org/doi/10.1007/978-3-030-46150-8_2
Welke PHorváth TWrobel S(2014)On the Complexity of Frequent Subtree Mining in Very Simple StructuresRevised Selected Papers of the 24th International Conference on Inductive Logic Programming - Volume 904610.1007/978-3-319-23708-4_14(194-209)Online publication date: 14-Sep-2014
https://dl.acm.org/doi/10.1007/978-3-319-23708-4_14
Horváth TPaass GReichartz FWrobel S(2009)A logic-based approach to relation extraction from textsProceedings of the 19th international conference on Inductive logic programming10.5555/1893538.1893543(34-48)Online publication date: 2-Jul-2009
https://dl.acm.org/doi/10.5555/1893538.1893543
Arias MKhardon R(2006)Complexity parameters for first order classesMachine Language10.1007/s10994-006-8261-364:1-3(121-144)Online publication date: 1-Sep-2006
https://dl.acm.org/doi/10.1007/s10994-006-8261-3
Hirata K(2005)Prediction-hardness of acyclic conjunctive queriesTheoretical Computer Science10.1016/j.tcs.2005.09.006348:1(84-94)Online publication date: 2-Dec-2005
https://dl.acm.org/doi/10.1016/j.tcs.2005.09.006
Alphonse éMatwin S(2004)Filtering Multi-Instance Problems to Reduce Dimensionality in Relational LearningJournal of Intelligent Information Systems10.5555/944249.94425222:1(23-40)Online publication date: 1-Jan-2004
https://dl.acm.org/doi/10.5555/944249.944252
Malerba D(2003)Learning Recursive Theories in the Normal ILP SettingFundamenta Informaticae10.5555/2370980.237098357:1(39-77)Online publication date: 1-Jan-2003
https://dl.acm.org/doi/10.5555/2370980.2370983
Fanizzi NFerilli SDi Mauro NBasile T(2003)Spaces of theories with ideal refinement operatorsProceedings of the 18th international joint conference on Artificial intelligence10.5555/1630659.1630737(527-532)Online publication date: 9-Aug-2003
https://dl.acm.org/doi/10.5555/1630659.1630737
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Inverse subsumption for complete explanatory induction

Larisa Maksimova on Implication, Interpolation, and Definability

Logic-based subsumption architecture

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations