Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

Finite and Rational Tree Constraints

From MaRDI portal
Publication:4318170
Jump to:navigation, search

DOI10.1093/JIGPAL/2.2.167zbMath0810.03006OpenAlexW2025204147MaRDI QIDQ4318170

Torbjörn Keisu

Publication date: 20 April 1995

Published in: Logic Journal of IGPL (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/jigpal/2.2.167


zbMATH Keywords

algorithmssatisfiabilityrational treesdecision procedureconjunctive normal formconcurrent programming languageClark equality theoryfirst-order equality theory over a Herbrand universe


Mathematics Subject Classification ID

Theory of programming languages (68N15) Decidability of theories and sets of sentences (03B25) Logic programming (68N17)








This page was built for publication: Finite and Rational Tree Constraints

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4318170&oldid=18266670"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 6 February 2024, at 20:30.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki