A full first-order constraint solver for decomposable theories (Q1044229): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10472-009-9142-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2043633856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressiveness of full first-order constraints in the algebra of finite or infinite trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving First-Order Constraints in the Theory of the Evaluated Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Full First-Order Constraint Solver for Decomposable Theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of finite or infinite trees revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposable theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of First-Order Theories into Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frontiers of Combining Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2701742 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(2^{2^{2^{pn}}}\) upper bound on the complexity of Presburger arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decision procedure for term algebras with queues / rank
 
Normal rank

Latest revision as of 06:31, 2 July 2024

scientific article
Language Label Description Also known as
English
A full first-order constraint solver for decomposable theories
scientific article

    Statements

    Identifiers