the integration of inductivelogicprogramming (ilp) and Bottlenose Dolphin Optimization (BDO) in this research addresses a pressing issue in today's information-saturated landscape: the proliferation of fake news...
详细信息
ISBN:
(纸本)9798350348798;9798350348804
the integration of inductivelogicprogramming (ilp) and Bottlenose Dolphin Optimization (BDO) in this research addresses a pressing issue in today's information-saturated landscape: the proliferation of fake news. In an era where misleading information can spread rapidly, traditional methods often fall short in effectively identifying deceptive *** combat this challenge, our approach harnesses the synergies of ilp and BDO. ilp plays a crucial role in constructing logical rules that capture intricate relationships within news data. By doing so, it delves deep into the content, seeking out patterns and inconsistencies that may not be obvious at first glance. BDO, on the other hand, takes inspiration from the social behavior of bottlenose dolphins to optimize the process of generating these rules. Just as dolphins collaborate and communicate to solve complex problems, BDO helps refine the logical rules for better accuracy. Ultimately, this research underscores the potential of bio-inspired optimization, such as BDO, combined withthe precision of logicprogramming (ilp) to strengthen the integrity of information dissemination platforms. In an age where the veracity of information is paramount, this innovative approach offers a promising solution to combat the spread of fake news and promote the dissemination of authentic, reliable information.
Matching logic is the foundation of the K semantic environment for the specification of programming languages and automated generation of evaluators and verification tools. NLML is a formalization of nominal logic, wh...
详细信息
ISBN:
(纸本)9798400713477
Matching logic is the foundation of the K semantic environment for the specification of programming languages and automated generation of evaluators and verification tools. NLML is a formalization of nominal logic, which facilitates specification and reasoning about languages with binders, as a matching logictheory. Many properties of interest are inductive, and to prove them an induction principle modulo alpha-equality is required. In this paper we show that an alpha-structural Induction Principle for any nominal binding signature can be derived in an extension of NLML with set variables and fixpoint operators. We illustrate the use of the principle to prove properties of the lambda-calculus, the computation model underlying functional programming languages. the techniques generalize to other languages with binders. the proofs have been written in and generated using Metamath Zero.
Graph clustering is a popular method to understand networks and make them accessible for downstream Machine Learning tasks. Especially for large networks, the results of graph clustering are difficult to explain, sinc...
详细信息
ISBN:
(纸本)9798350307092
Graph clustering is a popular method to understand networks and make them accessible for downstream Machine Learning tasks. Especially for large networks, the results of graph clustering are difficult to explain, since visualizations can be chaotic and the metric used for clustering can be non-interpretable. We propose a method to use inductivelogicprogramming to provide a post-hoc, local explanation for the results of an arbitrary graph clustering algorithm. Our interactive approach is based on three steps: (1) Formalizing graph data as input for the inductivelogicprogramming system Popper, (2) Qualifying entities from the graph as instances for the variables in the resulting formal logic statements and (3) Re-integrating user feedback on the provided, comprehensible statements into Popper. Compared to other benchmark graph clustering explanation approaches, the proposed method shows superior behaviour in terms of interpretability of the rules and clauses as well as in terms of interactivity on six benchmark datasets.
the integration of inductivelogicprogramming (ilp) and Bottlenose Dolphin Optimization (BDO) in this research addresses a pressing issue in today's information-saturated landscape: the proliferation of fake news...
详细信息
ISBN:
(数字)9798350348798
ISBN:
(纸本)9798350348804
the integration of inductivelogicprogramming (ilp) and Bottlenose Dolphin Optimization (BDO) in this research addresses a pressing issue in today's information-saturated landscape: the proliferation of fake news. In an era where misleading information can spread rapidly, traditional methods often fall short in effectively identifying deceptive content. To combat this challenge, our approach harnesses the synergies of ilp and BDO. ilp plays a crucial role in constructing logical rules that capture intricate relationships within news data. By doing so, it delves deep into the content, seeking out patterns and inconsistencies that may not be obvious at first glance. BDO, on the other hand, takes inspiration from the social behavior of bottlenose dolphins to optimize the process of generating these rules. Just as dolphins collaborate and communicate to solve complex problems, BDO helps refine the logical rules for better accuracy. Ultimately, this research underscores the potential of bio-inspired optimization, such as BDO, combined withthe precision of logicprogramming (ilp) to strengthen the integrity of information dissemination platforms. In an age where the veracity of information is paramount, this innovative approach offers a promising solution to combat the spread of fake news and promote the dissemination of authentic, reliable information.
the proceedings contain 14 papers. the special focus in this conference is on Rewriting logic and its Applications. the topics include: Automating Safety Proofs About Cyber-Physical Systems Using Rewriting Modulo SMT;...
ISBN:
(纸本)9783031124402
the proceedings contain 14 papers. the special focus in this conference is on Rewriting logic and its Applications. the topics include: Automating Safety Proofs About Cyber-Physical Systems Using Rewriting Modulo SMT;executable Semantics and Type Checking for Session-Based Concurrency in Maude;Parallel Maude-NPA for Cryptographic Protocol Analysis;maude as a Library: An Efficient All-Purpose programming Interface;rewriting Privacy;Canonical Narrowing with Irreducibility and SMT Constraints as a Generic Symbolic Protocol Analysis Method;an Overview of the Maude Strategy Language and its Applications;teaching Formal Methods to Undergraduate Students Using Maude;business Processes Analysis with Resource-Aware Machine Learning Scheduling in Rewriting logic;modeling, Algorithm Synthesis, and Instrumentation for Co-simulation in Maude;an Efficient Canonical Narrowing Implementation for Protocol Analysis;checking Sufficient Completeness by inductivetheorem Proving.
Propositionalization is the process of summarizing relational data into a tabular (attribute-value) format. the resulting table can next be used by any propositional learner. this approach makes it possible to apply a...
详细信息
ISBN:
(数字)9783030492106
ISBN:
(纸本)9783030492090;9783030492106
Propositionalization is the process of summarizing relational data into a tabular (attribute-value) format. the resulting table can next be used by any propositional learner. this approach makes it possible to apply a wide variety of learning methods to relational data. However, the transformation from relational to propositional format is generally not lossless: different relational structures may be mapped onto the same feature vector. At the same time, features may be introduced that are not needed for the learning task at hand. In general, it is hard to define a feature space that contains all and only those features that are needed for the learning task. this paper presents LazyBum, a system that can be considered a lazy version of the recently proposed OneBM method for propositionalization. LazyBum interleaves OneBM's feature construction method with a decision tree learner. this learner both uses and guides the propositionalization process. It indicates when and where to look for new features. this approach is similar to what has elsewhere been called dynamic propositionalization. In an experimental comparison withthe original OneBM and with two other recently proposed propositionalization methods (nFOIL and MODL, which respectively perform dynamic and static propositionalization), LazyBum achieves a comparable accuracy with a lower execution time on most of the datasets.
this book constitutes the thoroughly refereed post-conference proceedings of the 24thinternationalconference on inductivelogicprogramming, ilp 2014, held in Nancy, France, in September 2014. the 14 revised papers ...
ISBN:
(纸本)9783319237077
this book constitutes the thoroughly refereed post-conference proceedings of the 24thinternationalconference on inductivelogicprogramming, ilp 2014, held in Nancy, France, in September 2014. the 14 revised papers presented were carefully reviewed and selected from 41 submissions. the papers focus on topics such as the inducing of logic programs, learning from data represented withlogic, multi-relational machine learning, learning from graphs, and applications of these techniques to important problems in fields like bioinformatics, medicine, and text mining.
the proceedings contain 14 papers. the special focus in this conference is on inductivelogicprogramming. the topics include: Relational kernel-based grasping with numerical features;complex aggregates within random ...
ISBN:
(纸本)9783319405650
the proceedings contain 14 papers. the special focus in this conference is on inductivelogicprogramming. the topics include: Relational kernel-based grasping with numerical features;complex aggregates within random forests;distributed parameter learning for probabilistic ontologies;meta-interpretive learning of data transformation programs;statistical relational learning with soft quantifiers;ontology learning from interpretations in lightweight description logics;constructing markov logic networks from first-order default rules;a note on mining all graphs;processing markov logic networks with GPUs;using ilp to identify pathway activation patterns in systems biology;an algebraic prolog for kernel programming;an exercise in declarative modeling for relational query mining;learning inference by induction and identification of transition models of biological systems in the presence of transition noise.
Technologies for Industry-4.0 are evolving rapidly, and the term semantics is widely used. Various standardization groups claim that they provide mechanisms to express semantics or allow the integration of semantic in...
详细信息
ISBN:
(纸本)9781538635933
Technologies for Industry-4.0 are evolving rapidly, and the term semantics is widely used. Various standardization groups claim that they provide mechanisms to express semantics or allow the integration of semantic information. the emerging data format AutomationML (as IEC 62714) proposes a role-based approach to encode semantics in engineering models and has already standardized fundamental engineering concepts as role classes. However, for concrete data processing tasks the currently standardized role classes are not sufficient to unambiguously express the meaning of various vendor or application specific concepts, while user-defined role classes rely on hand wired semantics encoded in dedicated software, e.g. importer/exporters. Yet AutomationML system unit classes represent reusable engineering objects as relational models of AutomationML roles, attributes, interfaces, internal elements and links, which can be used to describe complex user-specific concepts. To enable an automatic machine interpretation of these unstandardized relational models, we transform AutomationML data to a formal and declarative semantic representation using the Web Ontology Language (OWL), and propose a rule mining approach to learn the intended meaning of user selected system unit classes, i.e. to identify the common relational structure shared by the selected engineering objects.
暂无评论