ISO-690 (author-date, English)

FENG, Nick, MARSSO, Lina, KHOLODETSKA, Yuliia und CHECHIK, Marsha, 2025. Bounded satisfiability checking of FOL∗ formulas with aggregations. Formal Methods in System Design. 1 Dezember 2025. Vol. 67, no. 3, p. 282-315. DOI 10.1007/s10703-025-00483-4.

Elsevier - Harvard (with titles)

Feng, N., Marsso, L., Kholodetska, Y., Chechik, M., 2025. Bounded satisfiability checking of FOL∗ formulas with aggregations. Formal Methods in System Design 67, 282-315. https://doi.org/10.1007/s10703-025-00483-4

American Psychological Association 7th edition

Feng, N., Marsso, L., Kholodetska, Y., & Chechik, M. (2025). Bounded satisfiability checking of FOL∗ formulas with aggregations. Formal Methods in System Design, 67(3), 282-315. https://doi.org/10.1007/s10703-025-00483-4

Springer - Basic (author-date)

Feng N, Marsso L, Kholodetska Y, Chechik M (2025) Bounded satisfiability checking of FOL∗ formulas with aggregations.. Formal Methods in System Design 67:282-315. https://doi.org/10.1007/s10703-025-00483-4

Juristische Zitierweise (Stüber) (Deutsch)

Feng, Nick/ Marsso, Lina/ Kholodetska, Yuliia/ Chechik, Marsha, Bounded satisfiability checking of FOL∗ formulas with aggregations., Formal Methods in System Design 2025, 282-315.

Bitte prüfen Sie die Zitate auf Korrektheit, bevor Sie diese in Ihre Arbeit einfügen.