All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

12 015 (0,439s)

Result

Probabilistic Rule Learning through Integer Linear Programming

Recent interest in probabilistic logic as a formalism for machine learning has motivated the formulation of "probabilistic rule learning", where the task is to induce a set of logical rules from a probabilistic...

IN - Informatika

  • 2011
  • D
Result

Branching-Time Model-Checking of Probabilistic Pushdown Automata

Complete classifiaction of computational complexity of the model-checking problem for probabilistic pushdown automata and qualitative fragments of the logics PCTL, PCTL* and PECTL* is reached....

IN - Informatika

  • 2009
  • Jx
Result

Branching-Time Model-Checking of Probabilistic Pushdown Automata

Complete classifiaction of computational complexity of the model-checking problem for probabilistic pushdown automata and qualitative fragments of the logics PCTL, PCTL* and PECTL* is reached....

IN - Informatika

  • 2007
  • O
Result

Integrating the Probabilistic Uncertainty to Fuzzy Systems in Fuzzy Natural Logic

In this paper, we introduce the concept of probabilistic fuzzy linguistic description to the theory of fuzzy natural logic. This is to integrate the probabilistic uncertainty to the standard fuzzy linguistic description. Th...

Applied mathematics

  • 2020
  • D
  • Link
Result

Automatic Verification of Competitive Stochastic Systems

expressed in this logic and implement the techniques in a probabilistic model checker of probabilistic systems that incorporate competitive behaviour. These systems are modelled collaborate or compete in order to achieve a...

IN - Informatika

  • 2013
  • Jx
  • Link
Result

Artificial Intelligence (4)

The textbook concentrates on generalized theory of inrormation, probabilistic algorithms, fuzzy logic, practical applications of fuzzy logic, genetic programming, differential evolution, applications of neural nets, approxi...

JC - Počítačový hardware a software

  • 2003
  • B
Result

Satisfiability of Quantitative Probabilistic CTL: Rise to the Challenge

The decidability of PCTL satisfiability is a challenging open problem in logic and formal verification. We give an overview of the existing results and proof techniques, and we also present some new results documenting the subtlety of the pr...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2022
  • D
  • Link
Result

Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances

probabilistic temporal logics. In this paper we concentrate on computing the expected values that are not expressible in conventional probabilistic temporal logics.Probabilistic pushdown automata (pPDA) h...

IN - Informatika

  • 2005
  • D
Result

Belief Based on Inconsistent Information

and is of a probabilistic nature. We use Belnap-Dunn logic and its probabilistic extensions to accountA recent line of research has developed around logics of belief based on evidence [4, 6]. The approach of [6] u...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2020
  • D
  • Link
Result

On the Decidability of Temporal Properties of Probabilistic Pushdown Automata

We consider qualitative and quantitative model-checking problems for probabilistic pushdown automata (pPDA) and various temporal logics. We prove that the qualitative and quantitative model-checking problem for omega-regular propert...

IN - Informatika

  • 2005
  • D
  • 1 - 10 out of 12 015