Results 101 to 110 of about 1,320,893 (348)
Partially Grounded Planning as Quantified Boolean Formula
This paper describes a technique for translating bounded propositional reachability problems, such as Planning, into Quantified Boolean Formulae (QBF).
Michael Cashmore, M. Fox, E. Giunchiglia
semanticscholar +1 more source
Quantified Propositional Gödel Logics [PDF]
It is shown that Gqp↑, the quantified propositional Gödel logic based on the truth-value set V↑ = {1 - 1/n : n≥1}∪{1}, is decidable. This result is obtained by reduction to Büchi's theory S1S.
Baaz, Matthias +2 more
core +2 more sources
Interval‐valued Caputo–Fabrizio fractional derivative in continuous programming
Abstract This study investigates a novel class of variational programming problems characterized by fractional interval values, formulated under the Caputo–Fabrizio fractional derivative with an exponential kernel. Invex and generalized invex functions are used to discuss the Mond–Weir‐type dual problem for the considered variational problem.
Krishna Kummari +2 more
wiley +1 more source
Does Treewidth Help in Modal Satisfiability?
Many tractable algorithms for solving the Constraint Satisfaction Problem (CSP) have been developed using the notion of the treewidth of some graph derived from the input CSP instance.
A. Herzig +24 more
core +1 more source
Small and mid‐sized pharmaceutical innovators often have limited in‐house health economics and market access expertise, and may struggle to align development strategies of investigational medicinal products with health system needs and payer expectations.
Zoltán Kaló +5 more
wiley +1 more source
Probing-Based Preprocessing Techniques for Propositional Satisfiability
Preprocessing is an often used approach for solving hard instances of propositional satisfiability (SAT). Preprocessing can be used for reducing the number of variables and for drastically modifying the set of clauses, either by eliminating irrelevant ...
Lynce, I., Marques-Silva, J. P.
core +1 more source
Abstract It is widely reported that teachers in their first 5 years of entering the profession are highly likely to leave their teaching positions. There have been many discussions on how to keep beginning teachers in the profession, mainly in Western countries.
Maxwell Peprah Opoku +7 more
wiley +1 more source
Intuitionistic Implication and Logics of Formal Inconsistency
Logics of Formal Inconsistency (LFI for short) are a class of paraconsistent logics that validate the principle of gentle explosion, meaning that any formula can be derived from the set of formulas: ∘α, α and ∼α. A unique feature of LFI is the use of the
Janusz Ciuciura
doaj +1 more source
Dependence is an important concept for many tasks in artificial intelligence. A task can be executed more efficiently by discarding something independent from the task.
Fang, Biqing +4 more
core +1 more source
Can boarding schools help looked after and vulnerable children improve academic attainment?
Abstract The education of children in statutory care, or at the edge of care, is a serious concern for governments and policymakers. How to promote educational opportunities for these children can involve challenging and often contentious proposals. In this paper, we study one proposal put into practice in England: the provision to children who are in ...
David Murphy +2 more
wiley +1 more source

