Results 21 to 30 of about 47,472 (286)
Axioms, 2023 Residuated basic logic (RBL) is the logic of residuated basic algebras, which constitutes a conservative extension of basic propositional logic (BPL). The basic implication is a residual of a non-associative binary operator in RBL.
Zhe Lin, Minghui Ma
doaj +1 more source
On the Expressiveness of TPTL and MTL over ω-Data Words [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent extensions of Linear Temporal Logic to specify properties about data languages.
Claudia Carapelle +3 more
doaj +1 more source
A Formal Model for Configurable Business Process with Optimal Cloud Resource Allocation [PDF]
Journal of Universal Computer Science, 2021 In today’s competitive business environments, organizations increasingly need to model and deploy flexible and cost effective business processes. In this context, configurable process models are used to offer flexibility by representing process
Abderrahim Ait Wakrime +4 more
doaj +3 more sources
Resolution Lower Bounds for Refutation Statements [PDF]
, 2019 For any unsatisfiable CNF formula we give an exponential lower bound on the size of resolution refutations of a propositional statement that the formula has a resolution refutation. We describe three applications.
Garlík, Michal
core +2 more sources
Bulletin of the Section of Logic, 2021 We examine the set of formula-to-formula valid inferences of Classical Logic, where the premise and the conclusion share at least a propositional variable in common. We review the fact, already proved in the literature, that such a system is identical to
Damian E. Szmuc
doaj +1 more source
Interval-based Synthesis [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We introduce the synthesis problem for Halpern and Shoham's modal logic of intervals extended with an equivalence relation over time points, abbreviated HSeq.
Angelo Montanari, Pietro Sala
doaj +1 more source
Does Advice Help to Prove Propositional Tautologies? [PDF]
, 2009 One of the starting points of propositional proof complexity is the seminal paper by Cook and Reckhow [6], where they defined propositional proof systems as poly-time computable functions which have all propositional tautologies as their range. Motivated
J. Balcázar +6 more
core +1 more source
A Structural Entropy Measurement Principle of Propositional Formulas in Conjunctive Normal Form
Entropy, 2021 The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot.
Zaijun Zhang, Daoyun Xu, Jincheng Zhou
doaj +1 more source
The curse genre of ’Kargys’ in the Kazakh language: Is the belief in the magical power of the word still preserved? [PDF]
Жанры речи, 2023 The speech genre of curse analyzed in the article belongs to the most ancient genres of oral communication in Kazakh culture. It is based on belief in the magical function of the word, in the ability to bring harm and evil to the cursed with the help of ...
Temirgazina, Zifa Kakbaevna +2 more
doaj +1 more source
Propositional Independence - Formula-Variable Independence and Forgetting
Journal of Artificial Intelligence Research, 2003 Independence -- the study of what is relevant to a given problem of reasoning -- has received an increasing attention from the AI community. In this paper, we consider two basic forms of independence, namely, a syntactic one and a semantic one. We show features and drawbacks of them.
J. Lang, LIBERATORE, Paolo, P. Marquis
openaire +4 more sources