Sciweavers

VMCAI
2012
Springer
12 years 3 days ago
A General Framework for Probabilistic Characterizing Formulae
Abstract. Recently, a general framework on characteristic formulae was proposed by Aceto et al. It offers a simple theory that allows one to easily obtain characteristic formulae o...
Joshua Sack, Lijun Zhang
JAPLL
2010
131views more  JAPLL 2010»
13 years 3 months ago
Algorithmic correspondence and completeness in modal logic. V. Recursive extensions of SQEMA
The previously introduced algorithm SQEMA computes first-order frame equivalents for modal formulae and also proves their canonicity. Here we extend SQEMA with an additional rule...
Willem Conradie, Valentin Goranko, Dimiter Vakarel...
MICS
2008
87views more  MICS 2008»
13 years 4 months ago
Spurious Disambiguation Errors and How to Get Rid of Them
The disambiguation approach to the input of formulae enables users of mathematical assistants to type correct formulae in a terse syntax close to the usual ambiguous mathematical n...
Claudio Sacerdoti Coen, Stefano Zacchiroli
CORR
1998
Springer
104views Education» more  CORR 1998»
13 years 4 months ago
Monotonicity and Persistence in Preferential Logics
An important characteristic of many logics for Arti cial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequ...
Joeri Engelfriet
APIN
1998
78views more  APIN 1998»
13 years 4 months ago
The Method of Assigning Incidences
Incidence calculus is a probabilistic logic in which incidences, standing for the situations in which formulae may be true, are assigned to some formulae, and probabilities are as...
Weiru Liu, David McBryan, Alan Bundy
AUTOMATICA
2000
71views more  AUTOMATICA 2000»
13 years 4 months ago
Linear quadratic bumpless transfer
The use of linear quadratic theory in bumpless transfer is discussed and a modification to a similar scheme proposed in [9] is suggested. Formulae are given for a feedback element...
Matthew C. Turner, Daniel J. Walker
COMPGEOM
1987
ACM
13 years 8 months ago
Polygon Properties Calculated from the Vertex Neighborhoods
Calculating properties of polyhedra given only the set of the locations and neighborhoods of the vertices is easy. Possible properties include volume, surface area, and point cont...
Wm. Randolph Franklin
IPPS
1998
IEEE
13 years 8 months ago
Using the BSP Cost Model to Optimise Parallel Neural Network Training
We derive cost formulae for three di erent parallelisation techniques for training supervised networks. These formulae are parameterised by properties of the target computer archit...
R. O. Rogers, David B. Skillicorn
DALT
2005
Springer
13 years 10 months ago
Complete Axiomatizations of Finite Syntactic Epistemic States
An agent who bases his actions upon explicit logical formulae has at any given point in time a finite set of formulae he has computed. Closure or consistency conditions on this se...
Thomas Ågotnes, Michal Walicki
MKM
2007
Springer
13 years 10 months ago
Spurious Disambiguation Error Detection
Abstract. The disambiguation approach to the input of formulae enables the user to type correct formulae in a terse syntax close to the usual ambiguous mathematical notation. When ...
Claudio Sacerdoti Coen, Stefano Zacchiroli