Results 101 to 110 of about 47,472 (286)
Probing-Based Preprocessing Techniques for Propositional Satisfiability
, 2003 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
Institutional Entrepreneurship and Work for Enhanced Sustainability at the Base of the Pyramid
Business Strategy and the Environment, EarlyView.ABSTRACT Promoting sustainability at the base of the pyramid (BoP) often falls short of inclusive development due to informal and fragmented institutions, creating institutional voids. Although institutions are critical in BoP settings, there is limited clarity on how institutional mechanisms can address sustainability challenges in low‐income contexts
Nikolas K. Kelling +2 more
wiley +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT With net zero CO2 emissions as the benchmark for mitigating the worst impacts of climate change by mid‐century, businesses are urged to deploy robust reduction measures. However, in light of increasing emissions globally, the effectiveness of current corporate decarbonization strategies remains unclear.
Linda Schenzle, Timo Busch
wiley +1 more source
ZDANIA AKSJOLOGICZNE Z PERSPEKTYWY NATURALIZMU [PDF]
The Polish Journal of Aesthetics, 2010 This paper discusses axiological sentences and views about them. Simple axiological sentences fall under the scheme (1) „a is P ”, where a stands for a proper name or a description and P corresponds to an axiological predicate, such as „is good”, or „is ...
Jan Woleński
doaj
Complexity of Propositional Proofs under a Promise [PDF]
, 2007 We study -- within the framework of propositional proof complexity -- the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiable formula has many satisfying assignments, where ``many'' stands for an explicitly ...
Dershowitz, Nachum, Tzameret, Iddo
core +3 more sources
Business Strategy and the Environment, EarlyView.ABSTRACT Although recent literature on the circular economy (CE) has highlighted the important role of ecosystems, there is still limited understanding of the main themes that characterize circular ecosystems. This study addresses this gap by combining a comprehensive topic modeling analysis employing latent Dirichlet allocation (LDA) with a systematic
Aline Gabriela Ferrari +4 more
wiley +1 more source
A Proof Calculus for Automated Deduction in Propositional Product Logic
MathematicsPropositional product logic belongs to the basic fuzzy logics with continuous t-norms using the product t-norm (defined as the ordinary product of real numbers) on the unit interval [0,1].
Dušan Guller
doaj +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT This paper investigates how environmental certifications—specifically, formal environmental management systems (EMSs) (ISO 14001, EMAS), and consumer‐facing eco‐labels—influence firm financial performance. Using a dual approach that includes a bibliometric review and a systematic analysis of key studies, we identify key trends, theoretical ...
Alberto Citterio
wiley +1 more source
Business Strategy and the Environment, EarlyView.ABSTRACT This study offers a comprehensive bibliometric and text‐mining overview of two decades of sustainability‐oriented entrepreneurship research. Drawing on 7563 peer‐reviewed articles from the Web of Science Core Collection, we map the field's evolution, thematic structure, and disciplinary convergence, identifying influential authors, networks ...
Giusy Sica +3 more
wiley +1 more source
Approximate Quantifier Elimination for Propositional Boolean Formulae [PDF]
, 2011 This paper describes an approximate quantifier elimination procedure for propositional Boolean formulae. The method is based on computing prime implicants using SAT and successively refining over-approximations of a given formula. This construction naturally leads to an anytime algorithm, that is, it can be interrupted at anytime without compromising ...
Brauer, Jorg, King, Andy
openaire +1 more source