( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Solving Systems of Equations over Hypersets.

, , , и . GULP-PRODE (1), стр. 403-417. (1994)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Eugenio Rivera

Eugenio Fava

Eugenio Amato

Eugenio Polito

Eugenio Corecco

 

Другие публикации лиц с тем же именем

Rasiowa-Sikorski Style Relational Elementary Set Theory., , и . RelMiCS, том 3051 из Lecture Notes in Computer Science, стр. 215-226. Springer, (2003)An Environment for Stepwise Map Specification and Reasoning in Prolog I: Three Language Extension Mechanisms., , и . APPIA-GULP-PRODE, стр. 87-. Facultad de Informática, Universidad Politécnica de Madrid, (2002)Theory-Specific Automated Reasoning., и . 25 Years GULP, том 6125 из Lecture Notes in Computer Science, Springer, (2010)Automation of Aggregate Theories: The Cornerstones of Equational Expressibility., , и . APPIA-GULP-PRODE, стр. 275-. Facultad de Informática, Universidad Politécnica de Madrid, (2002)Instructing Equational Set-Reasoning with Otter., , и . IJCAR, том 2083 из Lecture Notes in Computer Science, стр. 152-167. Springer, (2001)Polynomial-Time Satisfiability Tests for Boolean Fragments of Set Theory., , , и . CILC, том 2396 из CEUR Workshop Proceedings, стр. 123-137. CEUR-WS.org, (2019)A Proof-checking Experiment on Representing Graphs as Membership Digraphs., , и . CILC, том 1068 из CEUR Workshop Proceedings, стр. 227-233. CEUR-WS.org, (2013)From Hilbert's 10th Problem to slim, Undecidable Fragments of Set Theory., , и . ICTCS, том 2756 из CEUR Workshop Proceedings, стр. 47-60. CEUR-WS.org, (2020)Some Decidability Issues Concerning C^n Real Functions., , , , и . CILC, том 3733 из CEUR Workshop Proceedings, CEUR-WS.org, (2024)On Generalised Ackermann Encodings - The Basis Issue., , и . CILC, том 3733 из CEUR Workshop Proceedings, CEUR-WS.org, (2024)