the proceedings contain 37 papers from the Algorithmic Learning theory - 15thinternationalconference, ALT 2004. the topics discussed include: string pattern discovery;probabilistic inductive logicprogramming;on the...
详细信息
the proceedings contain 37 papers from the Algorithmic Learning theory - 15thinternationalconference, ALT 2004. the topics discussed include: string pattern discovery;probabilistic inductive logicprogramming;on the data consumption benefits of accepting increased uncertainty;boosting based on divide and merge;a criterion for the existence of predictive complexity for binary games;estimation of the data region using extreme-value distributions;maximum entropy principle in non-ordered setting;on the complexity of working set selection;convergence of a generalized gradient selection approach for the decomposition method;the subsumption lattice and query learning;and statistical learning in digital wireless communications.
Disjunction is generally considered to add expressive power to logic programs under the stable model semantics, which have become a popular programming paradigm for knowledge representation and reasoning. However, dis...
详细信息
It is commonly believed that the meaning of a formal declarative knowledge representation language is determined by its formal semantics. this is not quite so. this paper shows an epistemological ambiguity that arises...
详细信息
this paper studies computational issues related to the problem of reasoning about actions and change (RAC) by exploiting its link withthe Answer Set programming paradigm. It investigates how increasing the expressive...
详细信息
ISBN:
(纸本)9783540207214
this paper studies computational issues related to the problem of reasoning about actions and change (RAC) by exploiting its link withthe Answer Set programming paradigm. It investigates how increasing the expressiveness of a RAC formalism so that it can capture the three major problems of frame, ramification and qualification, affects its computational complexity, and how a solution to these problems can be implemented within Answer Set programming. Our study is carried out within the particular language Ε. It establishes a link between language Ε and Answer Set programming by presenting encodings of different versions of this language into logic programs under the answer set semantics. this provides a computational realization of solutions to problems related to reasoning about actions and change, that can make use of the recent development of effective systems for Answer Set programming.
there are two types of formalization for induction in logic. In descriptive induction, induced hypotheses describe rules with respect to observations with all predicates minimized. In explanatory induction, on the oth...
详细信息
ISBN:
(纸本)3540229418
there are two types of formalization for induction in logic. In descriptive induction, induced hypotheses describe rules with respect to observations with all predicates minimized. In explanatory induction, on the other hand, hypotheses abductively account for observations without any minimization principle. Both inductive methods have strength and weakness, which are complementary to each other. In this work, we unify these two logical approaches. In the proposed framework, not all predicates are minimized but minimality conditions can be flexibly determined as a circumscription policy. Constructing appropriate policies, we can intentionally minimize models of an augmented axiom set. As a result, induced hypotheses can have both conservativeness and explainability, which have been considered incompatible with each other in the literature. We also give two procedures to compute inductive hypotheses in the proposed framework.
We present a declarative language, PP, for the specification of preferences between possible solutions (or trajectories) of a planning problem. this novel language allows users to elegantly express non-trivial, multi-...
详细信息
the main contribution of this paper is the definition of the preference description language PDL. this language allows us to combine qualitative and quantitative, penalty based preferences in a flexible way. this make...
详细信息
An inference engine obtained by integrating smodels with a finite-domain solver capable of executing smodels program with aggregates was described. the engine was meant to be used in conjunction with front-ends capabl...
详细信息
ISBN:
(纸本)9783540207214
An inference engine obtained by integrating smodels with a finite-domain solver capable of executing smodels program with aggregates was described. the engine was meant to be used in conjunction with front-ends capable of performing high-level constraint handling of sets and aggregates. the use of a general constraint solver allows to easily understand and customize the way aggregates are handled. It also allows to easily extend the system to include new form of aggregates by simply adding new type of constraints.
this paper proposes two integer programming models and their GA-based solutions for optimal concept learning. the models are built to obtain the optimal concept description in the form of propositional logic formulas ...
详细信息
ISBN:
(纸本)3540228179
this paper proposes two integer programming models and their GA-based solutions for optimal concept learning. the models are built to obtain the optimal concept description in the form of propositional logic formulas from examples based on completeness, consistency and simplicity. the simplicity of the propositional rules is selected as the objective function of the integer programming models, and the completeness and consistency of the concept are used as the constraints. Considering the real-world problems that certain level of noise is contained in data set, the constraints in model 11 are slacked by adding slack-variables. To solve the integer programming models, genetic algorithm is employed to search the global solution space. We call our approach IP-AE. Its effectiveness is verified by comparing the experimental results with other well-known concept learning algorithms: AQ15 and C4.5.
the proceedings contain 33 papers. the special focus in this conference is on Concurrency theory. the topics include: Exploiting program structure for model checking concurrent software;a semantics for concurrent sepa...
ISBN:
(纸本)354022940X
the proceedings contain 33 papers. the special focus in this conference is on Concurrency theory. the topics include: Exploiting program structure for model checking concurrent software;a semantics for concurrent separation logic;resources, concurrency and local reasoning;resource control for synchronous cooperative threads;verifying finite-state graph grammars;basic theory of reduction congruence for two timed asynchronous π-calculi;characterizing EF and ex tree logics;message-passing automata are expressively equivalent to EMSO logic;symbolic bisimulation in the Spi calculus;a symbolic decision procedure for cryptographic protocols with time stamps;deciding probabilistic bisimilarity over infinite-state probabilistic systems;type based discretionary access control;elimination of quantifiers and undecidability in spatial logics for concurrency;modular construction of modal logics;verification by network decomposition;parameterised Boolean equation systems;an extensional spatial logic for mobile processes;extended process rewrite systems;a general approach to comparing infinite-state systems withtheir finite-state specifications;model checking timed automata with one or two clocks;on flatness for 2-dimensional vector addition systems with states;compiling pattern matching in join-patterns;model checking restricted sets of timed paths;open maps, alternating simulations and control synthesis;probabilistic event structures and domains;session types for functional multithreading and a higher order modal fixed point logic.
暂无评论