M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures (Q862395): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(10 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10817-005-9004-z / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Zapato / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: QOCA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ICS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Chaff / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: E Theorem Prover / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Cassowary / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVC Lite / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10817-005-9004-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2158995961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mechanizing Mathematical Reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4422082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751364 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and Algorithms for the Construction and Analysis of Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Negative-cycle detection algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4553256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Method of Solving Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3408132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backtracking algorithms for disjunctions of temporal constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4427902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4804883 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10817-005-9004-Z / rank
 
Normal rank

Latest revision as of 05:54, 10 December 2024

scientific article
Language Label Description Also known as
English
M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures
scientific article

    Statements

    M\textbf{ath}SAT: Tight integration of SAT and mathematical decision procedures (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    24 January 2007
    0 references
    propositional satisfiability techniques
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers