Tabling of structured data is important to support dynamic programming in logic programs. Several existing tabling systems for Prolog do not efficiently deal with structured data, but duplicate part of the structured ...
详细信息
A class of Probabilistic Abductive logic Programs (PALPs) is introduced and an implementation is developed in CHR for solving abductive problems, providing minimal explanations with their probabilities. Both all-expla...
详细信息
We propose a mechanism for the vertical refinement of bigraphical reactive systems, based upon a mechanism for limiting observations and utilising the underlying categorical structure of bigraphs. We present a motivat...
详细信息
We propose a mechanism for the vertical refinement of bigraphical reactive systems, based upon a mechanism for limiting observations and utilising the underlying categorical structure of bigraphs. We present a motivating example to demonstrate that the proposed notion of refinement is sensible with respect to the theory of bigraphical reactive systems;and we propose a sufficient condition for guaranteeing the existence of a safety-preserving vertical refinement. We postulate the existence of a complimentary notion of horizontal refinement for bigraphical agents, and finally we discuss the connection of this work to the general refinement of Reeves and Streader.
We provide upper bounds for the determining number and the metric dimension of tournaments. A set of vertices S⊆. V(T) is a determining set for a tournament T if every nontrivial automorphism of T moves at least one v...
详细信息
• Must respond to ongoing trends: — Drastic reductions in use of chemical energy — Exploiting knowledge: more “mental energy” • Reversal of one trend of recent past: — Uniform speeds and ceilings of most aircraft...
详细信息
• Must respond to ongoing trends: — Drastic reductions in use of chemical energy — Exploiting knowledge: more “mental energy” • Reversal of one trend of recent past: — Uniform speeds and ceilings of most aircraft — New approaches will promote non-uniformity • Trends will make ATM much harder to do — Requires explosive growth of Digital Avionics
作者：
Braüner, TorbenProgramming
Logic and Intelligent Systems Research Group Roskilde University P.O. Box 260 DK-4000 Roskilde Denmark
Intuitionistic hybrid logic is hybrid modal logic over an intuitionistic logic basis instead of a classical logical basis. In this short paper we introduce intuitionistic hybrid logic and we give a survey of work in t...
详细信息
Probabilistic models that associate annotations to sequential data are widely used in computational biology and a range of other applications. Models integrating with logic programs provide, furthermore, for sophistic...
详细信息
ISBN:
(纸本)9783939897316
Probabilistic models that associate annotations to sequential data are widely used in computational biology and a range of other applications. Models integrating with logic programs provide, furthermore, for sophistication and generality, at the cost of potentially very high computational complexity. A methodology is proposed for modularization of such models into sub-models, each representing a particular interpretation of the input data to be analysed. Their composition forms, in a natural way, a Bayesian network, and we show how standard methods for prediction and training can be adapted for such composite models in an iterative way, obtaining reasonable complexity results. Our methodology can be implemented using the probabilistic-logic PRISM system, developed by Sato et al, in a way that allows for practical applications.
We introduce notions of ordinary and standard products of a-finite measures and prove their existence. This approach allows us to construct invariant extensions of ordinary and standard products of Haar measures. In p...
详细信息
We introduce notions of ordinary and standard products of a-finite measures and prove their existence. This approach allows us to construct invariant extensions of ordinary and standard products of Haar measures. In particular, we construct translation-invariant extensions of ordinary and standard Lebesgue measures on R∞ and Rogers-Fremlin measures on l∞, respectively, such that topological weights of quasi-metric spaces associated with these measures are maximal （i.e., 2c）. We also solve some Fremlin problems concerned with an existence of uniform measures in Banach spaces.
A hidden Markov model (HMM) is a statistical model in which the system being modeled is assumed to be a Markov process with hidden states. This model has been widely used in speech recognition and biological sequence ...
详细信息
A hidden Markov model (HMM) is a statistical model in which the system being modeled is assumed to be a Markov process with hidden states. This model has been widely used in speech recognition and biological sequence analysis. Viterbi algorithm has been proposed to compute the most probable value of these hidden states in regards to an observed data sequence. Constrained HMM extends this framework by adding some constraints on a HMM process run. In this paper, we propose to introduce constrained HMMs into Constraint programming. We propose new version of the Viterbi algorithm for this new framework. Several constraint techniques are used to reduce the search of the most probable value of hidden states of a constrained HMM. An implementation based on PRISM, a logicprogramming language for statistical modeling, is presented.
This project aims to investigate biologically inspired, logic-statistic models with constraints. The complexity and expressiveness of models with different kinds of constraints will be examined and algorithms to effic...
详细信息
暂无评论