標題: Titlebook: Inductive Logic Programming; 17th International C Hendrik Blockeel,Jan Ramon,Prasad Tadepalli Conference proceedings 2008 Springer-Verlag B [打印本頁] 作者: 炸彈 時間: 2025-3-21 20:09
書目名稱Inductive Logic Programming影響因子(影響力)
書目名稱Inductive Logic Programming影響因子(影響力)學科排名
書目名稱Inductive Logic Programming網(wǎng)絡公開度
書目名稱Inductive Logic Programming網(wǎng)絡公開度學科排名
書目名稱Inductive Logic Programming被引頻次
書目名稱Inductive Logic Programming被引頻次學科排名
書目名稱Inductive Logic Programming年度引用
書目名稱Inductive Logic Programming年度引用學科排名
書目名稱Inductive Logic Programming讀者反饋
書目名稱Inductive Logic Programming讀者反饋學科排名
作者: heterogeneous 時間: 2025-3-21 23:01
Beyond Prediction: Directions for Probabilistic and Relational Learning can address. Recent work has extended these boundaries even further by unifying these two powerful learning frameworks. However, new frontiers await. Current techniques are capable of learning only a subset of the knowledge needed by practitioners in important domains, and further unification of pr作者: BRAND 時間: 2025-3-22 02:57
Learning Probabilistic Logic Models from Probabilistic Examples (Extended Abstract)data sets used by most PILP systems and applications have non-probabilistic class values, like those used in ILP systems. The main reason for this is the lack of an obvious source of probabilistic class values. In this context, we investigate the use of Abductive Stochastic Logic Programs (SLPs) for作者: allergen 時間: 2025-3-22 04:58 作者: 柱廊 時間: 2025-3-22 10:16
Learning to Assign Degrees of Belief in Relational Domainsly based on our judgements of the probability of uncertain events such as success in a new medical treatment or the state of the market. For example, if an agent wishes to employ the expected-utility paradigm of decision theory in order to guide its actions, it must assign subjective probabilities t作者: FLIC 時間: 2025-3-22 14:57 作者: objection 時間: 2025-3-22 17:43 作者: FISC 時間: 2025-3-23 00:03
Clustering Relational Data Based on Randomized Propositionalizationh based on randomized propositionalization, which allows for applying standard clustering algorithms like KMeans to multi-relational data. We describe how random rules are generated and then turned into boolean-valued features. Clustering generally is not straightforward to evaluate, but preliminary作者: Obstreperous 時間: 2025-3-23 02:30
Structural Statistical Software Testing with Active Learning in a Graph exploits the . in the control flow graph, that is, paths which are actually exerted for some values of the program input; the limitation is that feasible paths are massively outnumbered by infeasible ones. Addressing this limitation, this paper presents an active learning algorithm aimed at samplin作者: Tailor 時間: 2025-3-23 06:05 作者: 自然環(huán)境 時間: 2025-3-23 11:50 作者: N斯巴達人 時間: 2025-3-23 14:19 作者: OMIT 時間: 2025-3-23 19:29 作者: 陰郁 時間: 2025-3-24 01:50
A Phase Transition-Based Perspective on Multiple Instance Kernelsor Relational Learning. The so-called phase transition framework, originally developed for constraint satisfaction problems, has been extended to relational learning and it has provided relevant insights into the limitations and difficulties thereof. The goal of this paper is to examine relational S作者: 極小 時間: 2025-3-24 02:57
Combining Clauses with Various Precisions and Recalls to Produce Accurate Probabilistic Estimatesve Logic Programming (ILP). We propose a new SRL algorithm, GleanerSRL, to generate the probability that an example is positive within highly-skewed relational domains. In this work, we combine clauses from Gleaner, an ILP algorithm for learning a wide variety of first-order clauses, with the propos作者: 牢騷 時間: 2025-3-24 10:24
Applying Inductive Logic Programming to Process Miningdel in a language that allows the checking of the compliance of a process execution (or trace) to the model. In this paper we propose a language for the representation of process models that is inspired to the SCIFF language and is an extension of clausal logic. A process model is represented in the作者: 豪華 時間: 2025-3-24 13:18 作者: 群居男女 時間: 2025-3-24 15:46
Foundations of Refinement Operators for Description Logicsnguages in the Semantic Web, it is important to acquire a thorough understanding of the theoretical potential and limitations of using refinement operators within the description logic paradigm. In this paper, we present a comprehensive study which analyses desirable properties such operators should作者: gerontocracy 時間: 2025-3-24 20:15
A Relational Hierarchical Model for Decision-Theoretic Assistancek, a domain-independent decision-theoretic model of assistance was proposed, where the task is to infer the user’s goal and take actions that minimize the expected cost of the user’s policy. In this paper, we extend this work to domains where the user’s policies have rich relational and hierarchical作者: Chronological 時間: 2025-3-24 23:13
lity for the role of a general framework for modeling concurrent computation. As a basic tool we introduce a ‘modal’ logic of transition rules and runs, which is, in the context of evolving algebras, just a definitional extension of ordinary first order logic. A notion of independence of rules and r作者: macabre 時間: 2025-3-25 04:07 作者: Tractable 時間: 2025-3-25 09:41
David D. Jensenlity for the role of a general framework for modeling concurrent computation. As a basic tool we introduce a ‘modal’ logic of transition rules and runs, which is, in the context of evolving algebras, just a definitional extension of ordinary first order logic. A notion of independence of rules and r作者: 6Applepolish 時間: 2025-3-25 12:06 作者: 致命 時間: 2025-3-25 17:41 作者: Aggressive 時間: 2025-3-25 23:58
Frédéric Koriches a typed and an untyped language. Among the studies about the call-by-name lambda-mu-calculus authors used different presentations of the calculus that were usually considered as equivalent from the computational point of view. In particular, most of the papers use one of three variants of the calc作者: Fulminate 時間: 2025-3-26 03:33 作者: indoctrinate 時間: 2025-3-26 07:53 作者: Ascribe 時間: 2025-3-26 12:11 作者: 滑稽 時間: 2025-3-26 14:17 作者: deficiency 時間: 2025-3-26 17:33
Will Bridewell,Ljup?o Todorovskich has been extended to classical logic (cf. Girard 1991, Parigot 1991, and recently Danos Joinet Schellinx 1997). This paper introduces a new sequent calculus for (propositional) classical logic, indicated by .C. Both, the calculus and the cut-elimination procedure for .C extend those for . (Sambin作者: FAR 時間: 2025-3-26 21:26 作者: 接合 時間: 2025-3-27 03:43
Mark Goadrich,Jude Shavlikwhether or not it is definable in first-order logic with label tests and the order relation, and for first-order logic with the successor relation. In recent years, there has been much interest in languages over an infinite alphabet. Kaminski and Francez introduced a class of automata called finite 作者: configuration 時間: 2025-3-27 05:54 作者: AUGUR 時間: 2025-3-27 10:08
Jens Lehmann,Pascal Hitzlerinary or dyadic notation of integers). Let + and . respectively denote usual addition of integers and concatenation (of their dyadic notations). A RAM which uses only arithmetical operations of a set I is called an I - RAM. An LTTC-RAM is a RAM which only uses LTTC operations..In the present paper, 作者: Maximize 時間: 2025-3-27 16:17
Jens Lehmann,Pascal Hitzlerinary or dyadic notation of integers). Let + and . respectively denote usual addition of integers and concatenation (of their dyadic notations). A RAM which uses only arithmetical operations of a set I is called an I - RAM. An LTTC-RAM is a RAM which only uses LTTC operations..In the present paper, 作者: 評論性 時間: 2025-3-27 17:56 作者: AIL 時間: 2025-3-28 00:23
The power of the framework is demonstrated by developing simple and transparent evolving algebra models for the Chemical Abstract Machine of Berry and Boudol and for the .-calculus of Milner. Their respective notions of parallelism map directly and faithfully to native concurrency of evolving algeb作者: heterogeneous 時間: 2025-3-28 02:16 作者: blithe 時間: 2025-3-28 06:53 作者: optional 時間: 2025-3-28 14:27 作者: 吞吞吐吐 時間: 2025-3-28 16:29
Daan Fierens,Jan Ramon,Maurice Bruynooghe,Hendrik Blockeel The power of the framework is demonstrated by developing simple and transparent evolving algebra models for the Chemical Abstract Machine of Berry and Boudol and for the .-calculus of Milner. Their respective notions of parallelism map directly and faithfully to native concurrency of evolving algeb作者: 沒血色 時間: 2025-3-28 21:35
Frédéric Koriche, does enjoy the separation property. This evidence the fact that the calculi are really different and suggest that the relationships between the .-calculi should be made clear. This is the purpose of the present work..We first introduce four variants of call-by-name .-calculus, establish some resul作者: 著名 時間: 2025-3-29 02:17
Jennifer Neville,David Jensens an abstract data type rather than as binary digits we expect that logarithmic-size worktapes cannot be encoded using pointers as is done, e.g.?in totally-ordered . logic. We show that this is indeed the case by proving that the property “the number of nodes is a power of two,” which is in ., is no作者: 慷慨不好 時間: 2025-3-29 05:15 作者: analogous 時間: 2025-3-29 10:40 作者: Peak-Bone-Mass 時間: 2025-3-29 11:38
Nicolas Baskiotis,Michele Sebag and the cut-elimination process..In relation to the framework of basic logic, a remarkable result is that the extensions of basic logic (the ones that are “symmetric”) are obtained by means of structural rules. Also, and in agreement with the spirit of uniformity propound in [Sambin 97], the proced作者: 排斥 時間: 2025-3-29 18:50 作者: 描述 時間: 2025-3-29 23:20
Romaric Gaudel,Michèle Sebag,Antoine Cornuéjolsexpensive interaction with the environment. Furthermore, the original analysis presumed that state functions are total. Now we allow state functions, including equality, to be partial so that a function call may cause the algorithm as well as the ASM to hang. Since the emulating ASM does not make an作者: Complement 時間: 2025-3-30 03:48
Mark Goadrich,Jude Shavlikr of several variants of FMA with several data word logics. Then we consider the corresponding decision problem: given an automaton A and a logic, can the language recognized by A be defined in the logic? We show that it is undecidable for several variants of FMA, and then investigate the issue in d作者: Dignant 時間: 2025-3-30 05:31
Evelina Lamma,Paola Mello,Fabrizio Riguzzi,Sergio Storarice-based theorem provers. The procedure yields approximate proofs whose precision increases as the reasoner has more resources at her disposal. The algorithm is interruptible, improvable, dual, and can be exploited for anytime computation. Moreover, the algorithm is flexible enough to be used with a作者: 不自然 時間: 2025-3-30 10:01
Jens Lehmann,Pascal Hitzler+}-RAM (resp. {.}-RAM) R‘ with strongly poynomially compact memory..Note that Theorem 2 holds for both weak nondeterministic RAMs and strong nondeterministic RAMs, i.e. in case the RAMs have only nondeterministic goto instructions or in case they have an instruction to guess an integer..If moreover 作者: contrast-medium 時間: 2025-3-30 13:14 作者: 宇宙你 時間: 2025-3-30 16:47 作者: RECUR 時間: 2025-3-31 00:11 作者: GLADE 時間: 2025-3-31 03:58 作者: endarterectomy 時間: 2025-3-31 05:18 作者: Circumscribe 時間: 2025-3-31 11:34 作者: Engaged 時間: 2025-3-31 14:17
Bias/Variance Analysis for Relational Domainsthe use of approximate inference algorithms and through variation in the availability of test set information. To date, the impact of . error on relational model performance has not been investigated.作者: 倫理學 時間: 2025-3-31 19:11 作者: Cardioversion 時間: 2025-3-31 23:48 作者: 天然熱噴泉 時間: 2025-4-1 04:48 作者: habile 時間: 2025-4-1 08:25 作者: Monotonous 時間: 2025-4-1 11:12 作者: infarct 時間: 2025-4-1 16:00 作者: glamor 時間: 2025-4-1 22:30
Learning with Kernels and Logical Representations to explore the synergy between these two important paradigms of machine learning. In this extended abstract (see [1] for a longer version), I briefly review some of our recent work about statistical learning with kernel machines in the ILP setting.作者: 經(jīng)典 時間: 2025-4-1 23:11
