( en | de | ru )

 

Disambiguation of "Wadge, William W."

Author of the publication

copydeleteadd this publication to your clipboard
Minimum model semantics for logic programs with negation-as-failure.

, and . ACM Trans. Comput. Log., 6 (2): 441-467 (2005)

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. You can also use the button next to the name to display some publications already assigned to the person.

Edmund Wadge

William W McCorkle

William W Emilsen

William Jórasz

William Masselink

 

Other publications of authors with the same name

Intermittent Assertion Proofs in Lucid., and . IFIP Congress, page 723-726. (1977)Minimum model semantics for logic programs with negation-as-failure., and . ACM Trans. Comput. Log., 6 (2): 441-467 (2005)Extensional Higher-Order Logic Programming, , , and . CoRR, (2011)An Infinite-Valued Semantics for Logic Programs with Negation., and . JELIA, volume 2424 of Lecture Notes in Computer Science, page 456-467. Springer, (2002)The Dimensional Analysis of Data Flow Programs That Include Multidimensional and User-Defined Functions., , and . IEEE Big Data, page 2781-2789. IEEE, (2022)A Sufficient Condition for Strong Equivalence Under the Well-Founded Semantics., , and . ICLP, volume 3668 of Lecture Notes in Computer Science, page 414-415. Springer, (2005)The Lazy Evaluation of Infinitesimal Logic Expressions., and . PLC, page 3-7. CSREA Press, (2005)A Relational Algebra as a Query Language for Temporal DATALOG., and . DEXA, page 276-281. Springer-Verlag, Wien, (1992)Lucid - A Formal System for Writing and Proving Programs., and . SIAM J. Comput., 5 (3): 336-354 (1976)Erratum: SIAM J. Comput. 6(1): 200 (1976).Compiling Higher-Order Functions for Tagged-Dataflow., and . IFIP PACT, volume A-50 of IFIP Transactions, page 269-278. North-Holland, (1994)