Sciweavers

156 search results - page 22 / 32
» Decidability and Undecidability in Probability Logic
Sort
View
DLOG
1996
13 years 10 months ago
Number Restrictions on Complex Roles in Description Logics: A Preliminary Report
Number restrictions are concept constructors that are available in almost all implemented description logic systems. However, even though there has lately been considerable effort...
Franz Baader, Ulrike Sattler
ICLP
1997
Springer
14 years 22 days ago
Non-Failure Analysis for Logic Programs
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
Saumya K. Debray, Pedro López-García...
CADE
2007
Springer
14 years 9 months ago
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems
Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problem...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
CORR
2008
Springer
107views Education» more  CORR 2008»
13 years 8 months ago
Metric Structures and Probabilistic Computation
Abstract. Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical co...
Wesley Calvert
LICS
2009
IEEE
14 years 3 months ago
Statistic Analysis for Probabilistic Processes
—We associate a statistical vector to a trace and a geometrical embedding to a Markov Decision Process, based on a distance on words, and study basic Membership and Equivalence p...
Michel de Rougemont, Mathieu Tracol