5,862 research outputs found
Non-perturbative Renormalization of the Complete Basis of Four-fermion Operators and B-parameters
We present results on the B-parameters , and , at
, with the tree-level Clover action. The renormalization of the
complete basis of dimension-six four-fermion operators has been performed
non-perturbatively. Our results for and are in reasonable
agreement with those obtained with the (unimproved) Wilson action. This is not
the case for . We also discuss some subtleties arising from a
recently proposed modified definition of the B-parameters.Comment: Talk presented at Lattice '97, Edinburgh (UK), July 1997. LaTeX 3
pages, uses espcrc
Decidable Reasoning in Terminological Knowledge Representation Systems
Terminological knowledge representation systems (TKRSs) are tools for
designing and using knowledge bases that make use of terminological languages
(or concept languages). We analyze from a theoretical point of view a TKRS
whose capabilities go beyond the ones of presently available TKRSs. The new
features studied, often required in practical applications, can be summarized
in three main points. First, we consider a highly expressive terminological
language, called ALCNR, including general complements of concepts, number
restrictions and role conjunction. Second, we allow to express inclusion
statements between general concepts, and terminological cycles as a particular
case. Third, we prove the decidability of a number of desirable TKRS-deduction
services (like satisfiability, subsumption and instance checking) through a
sound, complete and terminating calculus for reasoning in ALCNR-knowledge
bases. Our calculus extends the general technique of constraint systems. As a
byproduct of the proof, we get also the result that inclusion statements in
ALCNR can be simulated by terminological cycles, if descriptive semantics is
adopted.Comment: See http://www.jair.org/ for any accompanying file
Structured Knowledge Representation for Image Retrieval
We propose a structured approach to the problem of retrieval of images by
content and present a description logic that has been devised for the semantic
indexing and retrieval of images containing complex objects. As other
approaches do, we start from low-level features extracted with image analysis
to detect and characterize regions in an image. However, in contrast with
feature-based approaches, we provide a syntax to describe segmented regions as
basic objects and complex objects as compositions of basic ones. Then we
introduce a companion extensional semantics for defining reasoning services,
such as retrieval, classification, and subsumption. These services can be used
for both exact and approximate matching, using similarity measures. Using our
logical approach as a formal specification, we implemented a complete
client-server image retrieval system, which allows a user to pose both queries
by sketch and queries by example. A set of experiments has been carried out on
a testbed of images to assess the retrieval capabilities of the system in
comparison with expert users ranking. Results are presented adopting a
well-established measure of quality borrowed from textual information
retrieval
Space Efficiency of Propositional Knowledge Representation Formalisms
We investigate the space efficiency of a Propositional Knowledge
Representation (PKR) formalism. Intuitively, the space efficiency of a
formalism F in representing a certain piece of knowledge A, is the size of the
shortest formula of F that represents A. In this paper we assume that knowledge
is either a set of propositional interpretations (models) or a set of
propositional formulae (theorems). We provide a formal way of talking about the
relative ability of PKR formalisms to compactly represent a set of models or a
set of theorems. We introduce two new compactness measures, the corresponding
classes, and show that the relative space efficiency of a PKR formalism in
representing models/theorems is directly related to such classes. In
particular, we consider formalisms for nonmonotonic reasoning, such as
circumscription and default logic, as well as belief revision operators and the
stable model semantics for logic programs with negation. One interesting result
is that formalisms with the same time complexity do not necessarily belong to
the same space efficiency class
Quenched Spectroscopy for the N=1 Super-Yang-Mills Theory
We present results for the Quenched SU(2) N=1 Super-Yang-Mills spectrum at
, on a lattice, in the OZI approximation. This is
a first step towards the understanding of the chiral limit of lattice N=1 SUSY.Comment: 3 pages, Latex, 2 ps figures, contribution to Lattice 97, Edinburgh
22-26 July 1997; to appear on Nucl. Phys. B. (Proc. Suppl.
Full QCD on APE100 Machines
We present the first tests and results from a study of QCD with two flavours
of dynamical Wilson fermions using the Hybrid Monte Carlo Algorithm (HMCA) on
APE100 machines.Comment: 23 pages, LaTeX, 13 PS figures not include
Non-perturbative renormalization in kaon decays
We discuss the application of the MPSTV non-perturbative method \cite{NPM} to
the operators relevant to kaon decays. This enables us to reappraise the
long-standing question of the rule, which involves
power-divergent subtractions that cannot be evaluated in perturbation theory.
We also study the mixing with dimension-six operators and discuss its
implications to the chiral behaviour of the parameter.Comment: Talk presented at LATTICE96(improvement), LaTeX 3 pages, uses
espcrc2, 2 postscript figure
Semantic Matchmaking as Non-Monotonic Reasoning: A Description Logic Approach
Matchmaking arises when supply and demand meet in an electronic marketplace,
or when agents search for a web service to perform some task, or even when
recruiting agencies match curricula and job profiles. In such open
environments, the objective of a matchmaking process is to discover best
available offers to a given request. We address the problem of matchmaking from
a knowledge representation perspective, with a formalization based on
Description Logics. We devise Concept Abduction and Concept Contraction as
non-monotonic inferences in Description Logics suitable for modeling
matchmaking in a logical framework, and prove some related complexity results.
We also present reasonable algorithms for semantic matchmaking based on the
devised inferences, and prove that they obey to some commonsense properties.
Finally, we report on the implementation of the proposed matchmaking framework,
which has been used both as a mediator in e-marketplaces and for semantic web
services discovery
Invisible Z decay width bounds on active-sterile neutrino mixing in the (3+1) and (3+2) models
In this work we consider the standard model extended with singlet sterile
neutrinos with mass in the eV range and mixed with the active neutrinos. The
active-sterile neutrino mixing renders new contributions to the invisible Z
decay width which, in the case of light sterile neutrinos, depends on the
active-sterile mixing matrix elements only. We then use the current
experimental value of the invisible Z decay width to obtain bounds on these
mixing matrix elements for both (3+1) and (3+2) models.Comment: 10 pages, 5 figure
Non-Perturbative Renormalisation of the Lattice Four-Fermion Operator
We compute the renormalised four-fermion operator using a
non-perturbative method recently introduced for determining the renormalisation
constants of generic lattice composite operators. Because of the presence of
the Wilson term, mixes with operators of different
chiralities. A projection method to determine the mixing coefficients is
implemented. The numerical results for the renormalisation constants have been
obtained from a simulation performed using the SW-Clover quark action, on a
lattice, at . We show that the use of the constants
determined non-perturbatively improves the chiral behaviour of the lattice kaon
matrix element \_{\latt}.Comment: LaTeX, 16 pages, 2 postscript figure
- …