A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Filters
Refining operational logics
2017
Proceedings of the International Conference on the Foundations of Digital Games - FDG '17
Preserved Fulltext
give the rst detailed explanation of how exactly operational logics combine; and suggest application domains for which operational logics-based analysis and knowledge representation are especially appropriate ...
is paper expands on and re nes the theoretical framework of operational logics, which simultaneously addresses how games operate at a procedural level and how games communicate these operations to players ...
HOW DO OPERATIONAL LOGICS COMPOSE? ...
doi:10.1145/3102071.3102107
dblp:conf/fdg/OsbornWM17
fatcat:qglcw6xryfcrblx2dbk4mfzoge
A Refinement Operator for Description Logics
[chapter]
2000
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
(and upward) re nement operators. ...
Technically, w e construct a complete and proper re nement operator for the ALER description logic (to avoid over tting, we disallow disjunctions from the target DL). ...
First, description logics represent a new sort of learning bias, w h i c h necessitates a more sophisticated re nement operator (than typical ILP re nement operators). ...
doi:10.1007/3-540-44960-4_3
fatcat:22ixsf4knnbyxpxk2rnxnnsrvi
Constructing refinement operators by decomposing logical implication
[chapter]
1993
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Using this decomposition, we will describe upward and downward re nement operators for all orderings, including -subsumption and logical implication. ...
T o nd solutions in the model, search algorithms use di erent generalization and specialization operators. ...
This deconstruction results in the decomposition of logical implication into six basic operations. These operations are used to nd re nement operators for all orderings. ...
doi:10.1007/3-540-57292-9_56
fatcat:crpldmauwbcrhfe2rjgjtq3rey
Measuring Similarity in Description Logics Using Refinement Operators
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
We will show how the ideas of refinement operators and refinement graph, originally introduced for inductive logic programming, can be used for assessing similarity in DL and also for abstracting away ...
This paper presents a novel measure for assessing similarity between individuals represented using Description Logic (DL). ...
A refinement operator for the EL logic Any EL concept C can be written as a conjunction of concepts C 1 . . . ...
doi:10.1007/978-3-642-23291-6_22
fatcat:2gtiv3djcndolegjsymyyep5wu
Concept learning in description logics using refinement operators
2009
Machine Learning
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2014; you can also visit the original URL.
The file type is application/pdf.
In this paper, we provide a learning algorithm based on refinement operators for the description logic ALCQ including support for concrete roles. ...
We develop the algorithm from thorough theoretical foundations by identifying possible abstract property combinations which refinement operators for description logics can have. ...
Analysing the Properties of Refinement Operators In this section, we analyse the properties of refinement operators in description logics. ...
doi:10.1007/s10994-009-5146-2
fatcat:fw5oumaqzncahkedvuevru5kvm
Toward an Improved Downward Refinement Operator for Inductive Logic Programming
2014
Italian Conference on Computational Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
However, the versions of these operators currently available in the literature are not able to handle some refinement tasks. ...
The space of Datalog Horn clauses under the OI assumption allows the existence of refinement operators that fulfill desirable properties. ...
Refinement operators are the means by which wrong hypotheses in a logic theory are changed in order to account for new examples with which they are incomplete or inconsistent. ...
dblp:conf/cilc/Ferilli14
fatcat:bepqdzaodjerhhumdrwa2i4gqq
Completeness and properness of refinement operators in inductive logic programming
1998
The Journal of Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
t> Within Inductive Logic Programming, refinement operators compute a set of specializations or generalizations of a clause. ...
Ideally, a refinement operator is locally finite, complete, and proper. ...
INTRODUCTION
Refinement Operators and Ideal Properties One of the major tasks in Inductive Logic Programming (ILP) is model inference (or concept learning), the induction of logical theories from examples ...
doi:10.1016/s0743-1066(97)00077-0
fatcat:3eg5flmiv5g4levlp7mgz72d2y
Refining aggregation operations in finite ordinal scales
2001
European Society for Fuzzy Logic and Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Qualitative aggregation operations such as min or max can be refined by discrimin and leximin orderings, in agreement with the Pareto ordering of vector evaluations. ...
Further refinements of discrimin orderings, as well as the generalization of discrimin and lexirnin t o functions other than min or max, are presented. ...
We try here to generalize this refinement technique to more general families of aggregation operation. We restrict to the case of symmetric functions. ...
dblp:conf/eusflat/DuboisP01
fatcat:lz53nx66nve3ldeicoav2bl22a
Concept Learning in Engineering based on Refinement Operator
2018
International Conference on Inductive Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
Moreover, we extend the ALC refinement operator in DL-Learner by exploiting the syntax specification of AML and show significant better learning performance. ...
Specifically, we transform AML document to the description logic OWL 2 DL and use the DL-Learner framework to learn the concepts of named classes. ...
Evaluation of CELOE using both refinement operators. ...
dblp:conf/ilp/HuaH18
fatcat:ublveslk75h75jlfsann3cxpoi
Foundations of Refinement Operators for Description Logics
[chapter]
Inductive Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
a thorough understanding of the theoretical potential and limitations of using refinement operators within the description logic paradigm. ...
In particular, we show that ideal refinement operators in general do not exist, which is indicative of the hardness inherent in learning in DLs. ...
This analysis is fundamental for using refinement operators in description logics and was requested in [6, 7] . ...
doi:10.1007/978-3-540-78469-2_18
dblp:conf/ilp/LehmannH07a
fatcat:cohunbx4gjcxhpy4rljwthbcui
A Refinement Operator Based Learning Algorithm for the $\mathcal{ALC}$ Description Logic
[chapter]
Inductive Logic Programming
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
In this paper, we provide the first learning algorithm based on refinement operators for the most fundamental description logic ALC. ...
With the advent of the Semantic Web, description logics have become one of the most prominent paradigms for knowledge representation and reasoning. ...
Learning in Description Logics using Refinement Operators Definition 1 (learning problem in description logics). ...
doi:10.1007/978-3-540-78469-2_17
dblp:conf/ilp/LehmannH07
fatcat:fxgwjegxlbehtol7rug6vvsdt4
Neutrosophic Actions, Prevalence Order, Refinement of Neutrosophic Entities, and Neutrosophic Literal Logical Operators
2015
Neutrosophic Sets and Systems
unpublished
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Then we extend the classical logical operators to neutrosophic literal logical operators and to refined literal logical operators, and we define the refinement neutrosophic literal space. ...
We then introduce the prevalence order on {T, I, F} with respect to a given neutrosophic operator "o", which may be subjective as defined by the neutrosophic experts; and the refinement of neutrosophic ...
operators, the refined literal logical operators, as well as the refinement neutrosophic literal space. ...
fatcat:qibkaggqxzdr3kpylkwl6bqvhy
Logic-based machine learning using a bounded hypothesis space: the lattice structure, refinement operators and a genetic algorithm approach
2016
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this thesis we also show how refinement operators can be adapted for a stochastic search and give an analysis of refinement operators within the framework of stochastic refinement search. ...
We also show that ideal refinement operators exist for bounded subsumption and that, by contrast with general subsumption, efficient least and minimal generalisation operators can be designed for bounded ...
He incorporated refinement operators in his model inference system MIS which was used for debugging definite logic programs. The concept of refinement operator has been the basis of many ILP systems. ...
doi:10.25560/29849
fatcat:kgzoveed45fv7dneirx7ef5dqu
Algebraic semantics of refinement modal logic
2016
Advances in Modal Logic
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
We develop algebraic semantics of refinement modal logic using duality theory. Refinement modal logic has quantifiers that are interpreted using a refinement relation. ...
We study the dual notion of refinement on algebras and present algebraic semantics of refinement modal logic. ...
In [7] refinement modal logic (RML) is introduced, wherein modal logic is augmented with a new operator 9 (and with its dual 8, they are interdefinable as usual), which quantifies over all refinements ...
dblp:conf/aiml/BakhtiariDF16
fatcat:agxt3tzpmvf4fm5ejyfw35ciq4
A note on refinement operators
[chapter]
1993
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Within this context the existence of a well behaved refinement operator complete for Horn clause logic is desirable. ...
Consideration is given to subsets of full Horn clause logic for which more efficient refinement operators can be constructed. ...
Acknowledgements My thanks to Wray Btmtiae who pointed out a flaw in the proof that p0 is a most general refinement operator. ...
doi:10.1007/3-540-56602-3_146
fatcat:fqp7ib2x7vg3bfpf5djnusupjy
« Previous
Showing results 1 — 15 out of 339,681 results