Towards ILP-based LTLf passive learning.
Saved in:
| Title: | Towards ILP-based LTLf passive learning. |
|---|---|
| Authors: | Ielo, Antonio1 (AUTHOR), Law, Mark2 (AUTHOR), Fionda, Valeria1 (AUTHOR), Ricca, Francesco1 (AUTHOR), Giacomo, Giuseppe De3 (AUTHOR), Russo, Alessandra4 (AUTHOR) |
| Source: | Journal of Logic & Computation. Mar2026, Vol. 36 Issue 2, p1-30. 30p. |
| Subjects: | Induction (Logic), Satisfiability (Computer science), Machine learning, Inference (Logic), Nonmonotonic logic |
| Abstract: | Inferring linear temporal logic over finite traces (|$\text{LTL}_{\text{f}}$|) formulas from a set of example traces, known as passive learning , presents significant challenges due to its combinatorial nature. In this paper, we introduce a novel approach to |$\text{LTL}_{\text{f}}$| passive learning based on inductive logic programming (ILP), leveraging the inductive learning of answer set programs framework. Our ILP-based method effectively exploits the set of example traces to guide the learning process, and experimental results demonstrate that it o ffers a more efficient solution compared to traditional techniques based on propositional satisfiability. [ABSTRACT FROM AUTHOR] |
| Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
| FullText | Text: Availability: 0 |
|---|---|
| Header | DbId: egs DbLabel: Engineering Source An: 192182663 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 0 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Towards ILP-based LTLf passive learning. – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Ielo%2C+Antonio%22">Ielo, Antonio</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Law%2C+Mark%22">Law, Mark</searchLink><relatesTo>2</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Fionda%2C+Valeria%22">Fionda, Valeria</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Ricca%2C+Francesco%22">Ricca, Francesco</searchLink><relatesTo>1</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Giacomo%2C+Giuseppe+De%22">Giacomo, Giuseppe De</searchLink><relatesTo>3</relatesTo> (AUTHOR)<br /><searchLink fieldCode="AR" term="%22Russo%2C+Alessandra%22">Russo, Alessandra</searchLink><relatesTo>4</relatesTo> (AUTHOR) – Name: TitleSource Label: Source Group: Src Data: <searchLink fieldCode="JN" term="%22Journal+of+Logic+%26+Computation%22">Journal of Logic & Computation</searchLink>. Mar2026, Vol. 36 Issue 2, p1-30. 30p. – Name: Subject Label: Subjects Group: Su Data: <searchLink fieldCode="DE" term="%22Induction+%28Logic%29%22">Induction (Logic)</searchLink><br /><searchLink fieldCode="DE" term="%22Satisfiability+%28Computer+science%29%22">Satisfiability (Computer science)</searchLink><br /><searchLink fieldCode="DE" term="%22Machine+learning%22">Machine learning</searchLink><br /><searchLink fieldCode="DE" term="%22Inference+%28Logic%29%22">Inference (Logic)</searchLink><br /><searchLink fieldCode="DE" term="%22Nonmonotonic+logic%22">Nonmonotonic logic</searchLink> – Name: Abstract Label: Abstract Group: Ab Data: Inferring linear temporal logic over finite traces (|$\text{LTL}_{\text{f}}$|) formulas from a set of example traces, known as passive learning , presents significant challenges due to its combinatorial nature. In this paper, we introduce a novel approach to |$\text{LTL}_{\text{f}}$| passive learning based on inductive logic programming (ILP), leveraging the inductive learning of answer set programs framework. Our ILP-based method effectively exploits the set of example traces to guide the learning process, and experimental results demonstrate that it o ffers a more efficient solution compared to traditional techniques based on propositional satisfiability. [ABSTRACT FROM AUTHOR] – Name: AbstractSuppliedCopyright Label: Group: Ab Data: <i>Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.) |
| PLink | https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=192182663 |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1093/logcom/exaf069 Languages: – Code: eng Text: English PhysicalDescription: Pagination: PageCount: 30 StartPage: 1 Subjects: – SubjectFull: Induction (Logic) Type: general – SubjectFull: Satisfiability (Computer science) Type: general – SubjectFull: Machine learning Type: general – SubjectFull: Inference (Logic) Type: general – SubjectFull: Nonmonotonic logic Type: general Titles: – TitleFull: Towards ILP-based LTLf passive learning. Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Ielo, Antonio – PersonEntity: Name: NameFull: Law, Mark – PersonEntity: Name: NameFull: Fionda, Valeria – PersonEntity: Name: NameFull: Ricca, Francesco – PersonEntity: Name: NameFull: Giacomo, Giuseppe De – PersonEntity: Name: NameFull: Russo, Alessandra IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 03 Text: Mar2026 Type: published Y: 2026 Identifiers: – Type: issn-print Value: 0955792X Numbering: – Type: volume Value: 36 – Type: issue Value: 2 Titles: – TitleFull: Journal of Logic & Computation Type: main |
| ResultId | 1 |