Recent empirical studies show that runtime distributions of backtrack procedures for solving hard combinatorial problems often have intriguing properties. Unlike standard distributions (such as the normal), such distr...
详细信息
ISBN:
(纸本)9783540005674
Recent empirical studies show that runtime distributions of backtrack procedures for solving hard combinatorial problems often have intriguing properties. Unlike standard distributions (such as the normal), such distributions decay slower than exponentially and have "heavy tails". Procedures characterized by heavy-tailed runtime distributions exhibit large variability in efficiency, but a very straightforward method called rapid randomized restarts has been designed to essentially improve their average performance. We show on two experimental domains that heavy-tailed phenomena can be observed in ILP, namely in the search for a clause in the subsumption lattice. We also reformulate the technique of randomized rapid restarts to make it applicable in ILP and show that it can reduce the average search-time.
In current-day software development, programmers often use programming patterns to clarify their intents and to increase the understandability of their programs. Unfortunately, most software development environments d...
详细信息
In current-day software development, programmers often use programming patterns to clarify their intents and to increase the understandability of their programs. Unfortunately, most software development environments do not adequately support the declaration and use of such patterns. To explicitly codify these patterns, we adopt a declarative meta programming approach. In this approach, we reify the structure of a (object-oriented) program in terms of logic clauses. We declare programming patterns as logic rules on top of these clauses. By querying the logic system, these rules allow us to check, enforce and search for occurrences of certain patterns in the software. As such, the programming patterns become an active part of the software development and maintenance environment. (C) 2002 Elsevier Science Ltd. All rights reserved.
In the field of deductive logic, relevant logic has been investigated for a long time, as a means to derive only conclusions which are related to all premises. Our proposal is to apply this concept of relevance as a c...
详细信息
ISBN:
(纸本)3540001700
In the field of deductive logic, relevant logic has been investigated for a long time, as a means to derive only conclusions which are related to all premises. Our proposal is to apply this concept of relevance as a criterion of appropriateness to hypotheses in inductivelogic, and in this paper we present some special hypotheses called residue hypotheses, which satisfy such kind of appropriateness. this concept of relevance is different from those often introduced in the field of inductivelogicprogramming. While those aimed at the reduction of search spaces, which went hand in hand with postulating criteria which restricted the appropriateness of formulae as hypotheses, the relevance concept presented in this paper can be regarded as 'logical smallness' of hypotheses, in contrast to 'syntactical smallness'. We also give a further refinement,. so-called minimized residue hypotheses, which constitute an interesting trade-off between these two types of smallness. We also give some results on bottom clauses and relevance.
the proceedings contain 32 papers. the special focus in this conference is on Learning Boolean Functions, Margin-Based Learning, Learning with Queries and inductive Inference. the topics include: On the Eigen spectrum...
ISBN:
(纸本)3540001700
the proceedings contain 32 papers. the special focus in this conference is on Learning Boolean Functions, Margin-Based Learning, Learning with Queries and inductive Inference. the topics include: On the Eigen spectrum of the gram matrix and its relationship to the operator Eigen spectrum;interim report on a musical discovery project;learning structure from sequences, with applications in a digital library;on learning monotone Boolean functions under the uniform distribution;maximizing agreements and coagnostic learning;optimally-smooth adaptive boosting and application to agnostic learning;large margin classification for moving targets;on the smallest possible dimension and the largest possible margin of linear arrangements representing given concept classes uniform distribution;a general dimension for approximately learning Boolean functions;the complexity of learning concept classes with polynomial general dimension;on the absence of predictive complexity for some games;consistency queries in information extraction;ordered term tree languages which are polynomial time inductively inferable from positive data;reflective inductive inference of recursive functions;on the learnability of vector spaces;learning, logic, and topology in a common framework;a pathology of bottom-up hill-climbing in inductive rule learning;minimised residue hypotheses in relevant logic;compactness and learning of classes of unions of erasing regular pattern languages;a negative result on inductive inference of extended pattern languages;asymptotic optimality of transductive confidence machine and an efficient PAC algorithm for reconstructing a mixture of lines.
One major drawback of logicprogramming, particularly Prolog, is the lack of mechanisms for structuring knowledge (i,e. program clauses). this makes programming-in-the-large a difficult task even using the module syst...
详细信息
ISBN:
(纸本)0769514170
One major drawback of logicprogramming, particularly Prolog, is the lack of mechanisms for structuring knowledge (i,e. program clauses). this makes programming-in-the-large a difficult task even using the module system. To overcome this, various attempts were made to extend the logicprogramming paradigm with object-oriented features. In [4] we introduced LOOP, a class-based, logic and object-oriented programming language, centered around the view of objects as persistent mutable terms with backtrackable state, which extends Prolog in a simple and straightforward fashion. To validate our ideas we recently developed a prototype based on expansion to Prolog code, implemented in Sicstus Prolog, a state of the art Prolog system which supports mutable terms with backtrackable destructive assignment.
this paper presents few extensions to the logic form representation and a method for transforming WordNet glosses into logic forms using a set of high-precision rules combined with a set of high recall heuristics. An ...
详细信息
ISBN:
(纸本)0769514170
this paper presents few extensions to the logic form representation and a method for transforming WordNet glosses into logic forms using a set of high-precision rules combined with a set of high recall heuristics. An almost 3% increase in POS tagging accuracy is achieved over state-of-the art results at the expense of user intervention on only 7.52% of words. We apply a nearest neighbor solution to parser switching that leads to 6.43% increase in exact sentence accuracy for glosses. logic Forms are derived with an accuracy of 89.46%.
In this paper we present a new method that uses data-flow coherence criteria in definite logic program generation. We outline three main advantages of these criteria supported by our results: i) drastically pruning th...
详细信息
ISBN:
(纸本)0769514170
In this paper we present a new method that uses data-flow coherence criteria in definite logic program generation. We outline three main advantages of these criteria supported by our results: i) drastically pruning the search space (around 90%), ii) reducing the set of positive examples and reducing or even removing the need for the set of negative examples, and iii) allowing the induction of predicates that are difficult or even impossible to generate by other methods. Besides these criteria, the approach takes into consideration the program termination condition for recursive predicates. the paper outlines some theoretical issues and implementation aspects of our system for automatic logic program induction.
the proceedings contain 48 papers. the special focus in this conference is on Model Checking and theorem Proving. the topics include: Software documentation and the verification process;certifying model checkers;forma...
ISBN:
(纸本)3540423451
the proceedings contain 48 papers. the special focus in this conference is on Model Checking and theorem Proving. the topics include: Software documentation and the verification process;certifying model checkers;formalizing a JVML verifier for initialization in a theorem prover;automated inductive verification of parameterized protocols;a practical approach to coverage in model checking;a fast bisimulation algorithm;symmetry and reduced symmetry in model checking;transformation-based verification using generalized retiming;a decomposed representation for layered symbolic manipulation of boolean functions;divide and conquer combinational logic equivalence VERification with false negative elimination;finite instantiations in equivalence logic with uninterpreted functions;model-checking with formula-dependent abstract models;verifying network protocol implementations by symbolic refinement checking;automatic abstraction for verification of timed circuits and systems;automated verification of a randomized distributed concensus protocol using cadence SMV and PRISM;analysis of recursive state machines;parameterized verification with automatically computed inductive assertions;a validity checker for the logic of equality with uninterpreted functions and memories, exploiting positive equality, and conservative transformations;automatic generation, verification, and implementation of security protocols;integrated canonizer and solver;a toolset for analysing algebraic specifications;a parallel verification platform for concurrent systems;the SLAM toolkit;iterating transducers;attacking symbolic state explosion;a unifying model checking approach for safety properties of parameterized systems;a BDD-based model checker for recursive programs;model checking the world wide web;the temporal logic sugar and a tool for reachability analysis of complex systems.
Semi-structured documents are now commonly used for exchanging information. the aim of this research is to apply deductive and inductive reasoning to semi-structured documents. From our observation that first-order te...
详细信息
暂无评论