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
To select and rank the relevant opinions, decision making based on weighted description logics is introduced. ... First results of a study on opinion mining with OMA in the financial sector are presented. ... Jürgen Schenk for cooperation in the project OMA. Klemens and Heike are winners of the Dr. Karl Helmut Eberle Foundation's award on the study "Digitization and Knowledge Transformation". ...doi:10.5220/0006576403340341 dblp:conf/ic3k/SchnattingerW17 fatcat:3wdvwhiyzjbnhcgxgwxnd2qpym
American Catholic Philosophical Quarterly
engages one merely in asserting the existence of the bare particulars or simple x’s and not in the least in the assertion of existence for any descriptive attributes. ... Quine, “On What There Is,” From a Logical Point of View, ed. cit., p. 10, (Italics mine). ...
The product of this joint effort has been a set of logic-based formalisms, such as the Relational Calculus (Codd 1970), Datalog (Ceriet al. 1990), Description Logics (Baaderet al. 2007), etc., capturing ... Much has happened in data and knowledge base research since the introduction of the relational model in Codd (1970) and its strong logical foundations influence its advances ever since. ... Motik for his presentation on Datalog-based formalisms in the Semantic-Web community. ...doi:10.1017/s1471068410000086 fatcat:2zi7w5eejvanpknuncdy6qmw2e
Fuzzy logic is used to represent vagueness and ambiguity in ontologies, weighted description logic expresses individual preferences. ... This paper shows how these influences can be best modeled using a combination of fuzzy description logic and weighted description logic. ... Preliminaries The following sections present our architecture for opinion and consensus mining OMA, classical description logic and two extensions, the weighted description logic and fuzzy description ...doi:10.11648/j.ijiis.20190803.11 fatcat:tabpr2vboffgrnq3onv6o66tom
In addition, its logical models can support play as real-time, graphical games with minimal user-interface description. ... LUDOCORE is a logical "game engine", linking game rules as reasoned about by game designers to the formal logic used by automated reasoning tools in AI. ... An existing way to represent purely abstract games in logic is GDL, the game description language  . ...doi:10.1109/itw.2010.5593368 dblp:conf/cig/SmithNM10 fatcat:7fgh2lottjd6ppb3wjo46fnsb4
Over the access control module, Isadora mined output completely covers an assertion based security specification of the design provided by the designers. ... We demonstrate Isadora may define the information flows within an access control module in isolation and within an SoC and over a RISC-V design. ... For each assertion Isadora mined either a property containing the assertion or found both a violation and the violating conditions for each assertion. ...arXiv:2106.07449v1 fatcat:tthuari24rbezgoukkh6kx7ase
However, there is long-standing and highly productive work in computational knowledge representation and reasoning, and computational processing of knowledge has a role in the world of Data Science. ... might be able to use existing biomedical knowledge to rank or evaluate hypotheses; it might explain or interpret data in light of prior knowledge, either in a Bayesian or other sort of framework. ... Logical inference Computational logical inference is a mapping from a base set of assertions to create additional assertions that are entailed by the base. ...doi:10.3233/ds-170001 pmid:30294517 pmcid:PMC6171523 fatcat:d5kjfs24nvdsne4mmzrdfb5wsq
Lecture Notes in Computer Science
Learning in Description Logics (DLs) has been paid increasing attention over the last decade. ... In this paper we present a declarative modeling language for Concept Learning in DLs which relies on recent results in the fields of Knowledge Representation and Machine Learning. ... Acknowledgements The author would like to thank Luc De Raedt for the fruitful discussion on the open issues of declarative modeling for ML/DM, not only in general but also in the specific case of interest ...doi:10.1007/978-3-642-38812-5_11 fatcat:lzctzmztybch3bopzrxhrlqp4y
IFIP Advances in Information and Communication Technology
Assertions are generally defined by verification engineers that manually convert informal specifications in logic formulas according to their expertise. ... Unfortunately, in most cases, existing mining tools generate a set of over-constrained assertions. ... In particular, [24, 9] try to mine a set of temporal assertions reporting how arithmetic/logic relations change during the execution of the design. ...doi:10.1007/978-3-319-46097-0_10 fatcat:yrnma7vmb5dbdaf7nky6drjiga
Thus, the semantic field is used to connect modal logic with set theory in order to obtain a better description of uncertainty.” 03B General logic 2001e:03050 2001¢:03047 03B45 Shimura, Tatsuya (J-NIHOS ... Logic 29 (2000), no. 1, 1-74. An assertion of high conditional probability (HCP) is an assertion that the conditional probability of one proposition given another is close to 1. ...
Indeed, the descriptive use of verbs of action is so important as to obscure even more in their case than in the case of "this is yours", "this is his", etc., the non-descriptive use, but the logical character ... It is clear that Hart would be incorrect if he asserted that utterances with the form "This is mine" or "He did it" could not be true or false. ...doi:10.15388/problemos.2018.93.11760 fatcat:u5cxy6m6jbcxvb5m6cl5xwjfp4
In this data description, we present a simple dataset that contains data on over 400k proof method applications along with over 100 extracted features for each in a format that can be processed easily ... Our simple data format allows machine learning practitioners to try machine learning tools to predict proof methods in Isabelle/HOL without requiring domain expertise in logic. ... Previously we developed, smart_induct  , to address this problem for the induct method in Isabelle/HOL, using a domain-specific language for logical feature extraction  . ...arXiv:2004.10667v3 fatcat:yrd3dmroa5gojfrkg5noo2twty
In particular we consider the setting of using a language that combines description logics with DL-safe rules. ... Note: To appear in Theory and Practice of Logic Programming (TPLP) ... King for valuable discussions on KR and data mining in biology, and the remarks on earlier versions of the paper, to Jan Ramon for explanations on the concept of the semantic freeness of Datalog patterns ...arXiv:1003.2700v2 fatcat:xoevmzoldzaytnrwnjk2c26ruu
What logic as a practical science is chiefly occupied with is the determination, when any Thesis and any Reason are before us, of the further assertion (if any) required to stop all gaps in conclusive ... Again, under the predication-view, the Predi- cate in propositions asserting causation can hardly help becoming exceedingly unwieldy, and the central point of the assertion is often rendered obscure. ...
., if C I ⊆ D I for all C ⊑ D in T . If all concept descriptions in a TBox T are from a description logic L, then we call T a L-TBox. ... from a Description Logic L, then we call A a L-ABox. ...doi:10.1145/1988688.1988696 dblp:conf/wims/Turhan11 fatcat:iemskztbeneb3gn3tct4qkigxm
« Previous Showing results 1 — 15 out of 69,014 results