Zobrazeno 1 - 10
of 380
pro vyhledávání: '"Marek V"'
This paper examines the use of Lie group and Lie Algebra theory to construct the geometry of pairwise comparisons matrices. The Hadamard product (also known as coordinatewise, coordinate-wise, elementwise, or element-wise product) is analyzed in the
Externí odkaz:
http://arxiv.org/abs/2101.05271
Autor:
Koczkodaj, W. W., Liu, F., Marek, V. W., Mazurek, J., Mazurek, M., Mikhailov, L., Özel, C., Pedrycz, W., Przelaskowski, A., Schumann, A., Smarzewski, R., Strzalka, D., Szybowski, J., Yayli, Y.
This paper examines the constricted use of group theory in the studies of pairwise comparisons. The presented approach is based on the application of the famous Levi Theorems of 1942 and 1943 for orderable groups. The theoretical foundation for multi
Externí odkaz:
http://arxiv.org/abs/1903.07985
_e is the effective list of all finite predicate logic programs.is the list of recursive trees. We modify constructions of Marek, Nerode, and Remmel [25] to construct recursive functions f and g such that for all indices e, (i) there is a o
Externí odkaz:
http://arxiv.org/abs/1303.6555
Autor:
Marek, V., Potey, A., Réaux-Le-Goazigo, A., Reboussin, E., Charbonnier, A., Villette, T., Baudouin, C., Rostène, W., Denoyer, A., Mélik Parsadaniantz, S.
Publikováno v:
In Free Radical Biology and Medicine 1 February 2019 131:27-39
Autor:
Marek, V. W., Remmel, J. B.
We apply proof-theoretic techniques in answer Set Programming. The main results include: 1. A characterization of continuity properties of Gelfond-Lifschitz operator for logic program. 2. A propositional characterization of stable models of logic pro
Externí odkaz:
http://arxiv.org/abs/0905.0197
Autor:
Marek, V. W., Remmel, J. B.
We describe a variant of resolution rule of proof and show that it is complete for stable semantics of logic programs. We show applications of this result.
Comment: 13 pages, some results added. Accepted for publication at TPLP
Comment: 13 pages, some results added. Accepted for publication at TPLP
Externí odkaz:
http://arxiv.org/abs/0904.3953
We introduce and study logic programs whose clauses are built out of monotone constraint atoms. We show that the operational concept of the one-step provability operator generalizes to programs with monotone constraint atoms, but the generalization i
Externí odkaz:
http://arxiv.org/abs/cs/0608103
The paper presents a constructive fixpoint semantics for autoepistemic logic (AEL). This fixpoint characterizes a unique but possibly three-valued belief set of an autoepistemic theory. It may be three-valued in the sense that for a subclass of formu
Externí odkaz:
http://arxiv.org/abs/cs/9901003
Autor:
Marek, V. Wiktor, Mycielski, Jan
Publikováno v:
The American Mathematical Monthly, 2001 May 01. 108(5), 449-468.
Externí odkaz:
https://www.jstor.org/stable/2695803