Dominance Constraints With Boolean Connectives: A Model-Eliminative Treatment

Theoretical Computer Science - Netherlands
doi 10.1016/s0304-3975(01)00350-4
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Boolean Satisfiability With Transitivity Constraints

ACM Transactions on Computational Logic
Computational MathematicsTheoretical Computer ScienceComputer ScienceLogic
2002English

Nonmonotonic Reasoning With Quantified Boolean Constraints

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1997English

Portfolio Optimization With Stochastic Dominance Constraints

Journal of Banking and Finance
EconomicsEconometricsFinance
2006English

Classes of Valuations Closed Under Operations Galois-Dual to Boolean Sentence Connectives

Publications of the Research Institute for Mathematical Sciences
Mathematics
1996English

A Translation of Pseudo-Boolean Constraints to SAT

Journal on Satisfiability, Boolean Modeling and Computation
2006English

A Model of Assortative Mating With Partial Dominance

Heredity
Genetics
1977English

Gluon Dominance Model

EPJ Web of Conferences
AstronomyPhysics
2017English

A Propositional Logic of Temporal Connectives

Logic and Logical Philosophy
Philosophy
2014English

A Sprouting Tree Model for Random Boolean Functions

Random Structures and Algorithms
MathematicsApplied MathematicsComputer GraphicsComputer-Aided DesignSoftware
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy