全体
发表于 2025-3-21 17:10:11
书目名称Algebraic Methodology and Software Technology (AMAST’93)影响因子(影响力)<br> http://figure.impactfactor.cn/if/?ISSN=BK0152667<br><br> <br><br>书目名称Algebraic Methodology and Software Technology (AMAST’93)影响因子(影响力)学科排名<br> http://figure.impactfactor.cn/ifr/?ISSN=BK0152667<br><br> <br><br>书目名称Algebraic Methodology and Software Technology (AMAST’93)网络公开度<br> http://figure.impactfactor.cn/at/?ISSN=BK0152667<br><br> <br><br>书目名称Algebraic Methodology and Software Technology (AMAST’93)网络公开度学科排名<br> http://figure.impactfactor.cn/atr/?ISSN=BK0152667<br><br> <br><br>书目名称Algebraic Methodology and Software Technology (AMAST’93)被引频次<br> http://figure.impactfactor.cn/tc/?ISSN=BK0152667<br><br> <br><br>书目名称Algebraic Methodology and Software Technology (AMAST’93)被引频次学科排名<br> http://figure.impactfactor.cn/tcr/?ISSN=BK0152667<br><br> <br><br>书目名称Algebraic Methodology and Software Technology (AMAST’93)年度引用<br> http://figure.impactfactor.cn/ii/?ISSN=BK0152667<br><br> <br><br>书目名称Algebraic Methodology and Software Technology (AMAST’93)年度引用学科排名<br> http://figure.impactfactor.cn/iir/?ISSN=BK0152667<br><br> <br><br>书目名称Algebraic Methodology and Software Technology (AMAST’93)读者反馈<br> http://figure.impactfactor.cn/5y/?ISSN=BK0152667<br><br> <br><br>书目名称Algebraic Methodology and Software Technology (AMAST’93)读者反馈学科排名<br> http://figure.impactfactor.cn/5yr/?ISSN=BK0152667<br><br> <br><br>
CHIDE
发表于 2025-3-21 23:54:33
https://doi.org/10.1007/978-1-62703-514-9ng about space. One kind of reasoning problem, called a ‘constraint satisfaction problem’, can be defined for arbitrary relation algebras. It will be shown here that the constraint satisfiability problem is NP-complete for almost all compass and interval algebras.
municipality
发表于 2025-3-22 04:07:47
Itamar Kanter,Gur Yaari,Tomer Kalisky format is given, as general as possible, such that this equivalence is a congruence for all operators specifiable in that format. And for several formats it is determined what is the coarsest congruence with respect to all operators in this format that is finer than partial or completed trace equivalence.
carotenoids
发表于 2025-3-22 05:17:16
http://reply.papertrans.cn/16/1527/152667/152667_4.png
土坯
发表于 2025-3-22 10:58:52
Relation Algebras for Reasoning about Time and Spaceng about space. One kind of reasoning problem, called a ‘constraint satisfaction problem’, can be defined for arbitrary relation algebras. It will be shown here that the constraint satisfiability problem is NP-complete for almost all compass and interval algebras.
主动脉
发表于 2025-3-22 14:05:55
Full Abstraction in Structural Operational Semantics (extended abstract) format is given, as general as possible, such that this equivalence is a congruence for all operators specifiable in that format. And for several formats it is determined what is the coarsest congruence with respect to all operators in this format that is finer than partial or completed trace equivalence.
健谈的人
发表于 2025-3-22 19:10:15
http://reply.papertrans.cn/16/1527/152667/152667_7.png
Palpitation
发表于 2025-3-22 23:51:50
https://doi.org/10.1007/978-1-4684-7867-9applied it to quantifier logics too). The number of applications grew ever since. (Though some of these remained unnoticed, e.g. the celebrated Kripke-Lemmon completeness theorem for modal logic w.r.t. Kripke models was first proved by Jónsson and Tarski in 1948 using algebraic logic.)
insidious
发表于 2025-3-23 05:14:48
http://reply.papertrans.cn/16/1527/152667/152667_9.png
希望
发表于 2025-3-23 09:11:05
http://reply.papertrans.cn/16/1527/152667/152667_10.png