Filters
Term Satisfiability in FLew-Algebras
with exchange and weakening. We investigate two relations, called satisfiability and positive satisfiability, between FLew-terms and FLew-algebras. For each FLew-algebra, the sets of its satisfiable and positively sati...
Pure mathematics
- 2016 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Satisfying states of triangulations of a convex n-gon
The number of satisfying states is counted using the transfer matrix method.
BA - Obecná matematika
- 2010 •
- Jx
Rok uplatnění
Jx - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)
On the complexity of circuit satisfiability
We derive tight bounds on the exponent of the success probability for deciding the circuit satisfiability problem in a variety of probabilistic computational models under complexity asumptions....
BA - Obecná matematika
- 2010 •
- D
Rok uplatnění
D - Stať ve sborníku
The Satisfiability Problem for a Quantitative Fragment of PCTL
We give a sufficient condition under which every finite-satisfiable formula of a given PCTL fragment has a model with at most doubly exponential number of states (consequently, the finite satisfiability problem for the fragment is i...
Computer and information sciences
- 2021 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Satisfiability of Non-linear Transcendental Arithmetic as a Certificate Search Problem
For typical first-order logical theories, satisfying assignments have assignment satisfies the given formula. For non-linear real arithmetic with transcendental functions, however, no general finite representation of satisfying<...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2023 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Ways to Obtaining a Satisfied Customer
The article is concerned with ways to obtaining a satisfied customer.
AE - Řízení, správa a administrativa
- 2005 •
- D
Rok uplatnění
D - Stať ve sborníku
A variety of Steiner loops satisfying Moufang's theorem: a solution to Rajah's Problem
A loop X is said to satisfy Moufang's theorem if for every x,y,z in X such that x(yz)=(xy)z the subloop generated by x,y,z is a group. We prove that the variety V of Steiner loops satisfying the identity (xz)(((xy)z)(yz))=((xz)...
Pure mathematics
- 2020 •
- Jimp •
- Link
Rok uplatnění
Jimp - Článek v periodiku v databázi Web of Science
Výsledek na webu
Solving SMT Problems with a Costly Decision Procedure by Finding Minimum Satisfying Assignments of Boolean Formulas
a satisfying assignment of the propositional skeleton of the predicate formula short satisfying assignments in the SAT solving phase. Unfortunately most for satisfiable formulas even if they can be satisfied by as...
IN - Informatika
- 2013 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Phase Transition in Matched Formulas and a Heuristic for Biclique Satisfiability
in a context of matched formulas and their generalization of biclique satisfiable formulas is satisfiable, and it remains satisfiable even if we change polarities of any literal property-varsatisfiable and biclique sat...
Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
- 2019 •
- D •
- Link
Rok uplatnění
D - Stať ve sborníku
Výsledek na webu
Which Fuzzy Logic Satisfy the Compactness Problem?
Compactness in an important property of a classical logic. It states that simultaneous satisfiability of an infinite set of formulas is equivalent to the satisfiablity of all its subsets. In fuzzy logics, we have different degrees of sat...
BA - Obecná matematika
- 2002 •
- D
Rok uplatnění
D - Stať ve sborníku
- 1 - 10 out of 4 948