A complete subsumption algorithmFERILLI, Stefano; DI MAURO, Nicola; BASILE, Teresa M. A et al.Lecture notes in computer science. 2003, pp 1-13, issn 0302-9743, isbn 3-540-20119-X, 13 p.Conference Paper

Epistemic entrenchment and arithmetical hierarchyHAJEK, P.Artificial intelligence. 1993, Vol 62, Num 1, pp 79-87, issn 0004-3702Article

Nominal logic : A first order theory of names and bindingPITTS, Andrew M.Lecture notes in computer science. 2001, pp 219-242, issn 0302-9743, isbn 3-540-42736-8Conference Paper

Incompleteness of first-order temporal logic with untilSZALAS, A; HOLENDERSKI, L.Theoretical computer science. 1988, Vol 57, Num 2-3, pp 317-325, issn 0304-3975Article

A new clausal class decidable by hyperresolutionGEORGIEVA, Lilia; HUSTADT, Ullrich; SCHMIDT, Renate A et al.Lecture notes in computer science. 2002, pp 260-274, issn 0302-9743, isbn 3-540-43931-5, 15 p.Conference Paper

Logical heirarchies in PTIMEHELLA, L.Information and computation (Print). 1996, Vol 129, Num 1, pp 1-19, issn 0890-5401Article

First-order logics for comparative similarityWILLIAMSON, T.Notre Dame journal of formal logic. 1988, Vol 29, Num 4, pp 457-481, issn 0029-4527Article

Symbolic checking of signal-transition consistency for verifying high-level designsHAMAGUCHI, Kiyoharu; URUSHIHARA, Hidekazu; KASHIWABARA, Toshinobu et al.Lecture notes in computer science. 2000, pp 455-469, issn 0302-9743, isbn 3-540-41219-0Conference Paper

A constant-space sequential model of computation for first-order logicLINDELL, S.Information and computation (Print). 1998, Vol 143, Num 2, pp 231-250, issn 0890-5401Conference Paper

Levesque's axiomatization of only knowing is incompleteHALPERN, J. Y; LAKEMEYER, G.Artificial intelligence. 1995, Vol 74, Num 2, pp 381-387, issn 0004-3702Article

Logical omniscience, semantics, and models of beliefHADLEY, R. F.Computational intelligence. 1988, Vol 4, Num 1, pp 17-30, issn 0824-7935Article

A three-valued quantificational logic of contextSU, K; DING, D; CHEN, H et al.Lecture notes in computer science. 1997, pp 343-352, issn 0302-9743, isbn 3-540-63357-XConference Paper

The practicality of generating semantic trees for proofs of unsatisfiabilityALMULLA, M; NEWBORN, M.International journal of computer mathematics. 1996, Vol 62, Num 1-2, pp 45-61, issn 0020-7160Article

Learning, logic, and topology in a common frameworkMARTIN, Eric; SHARMA, Arun; STEPHAN, Prank et al.Lecture notes in computer science. 2002, pp 248-262, issn 0302-9743, isbn 3-540-00170-0, 15 p.Conference Paper

A semantic tableau version of first-order quasi-classical logicHUNTER, Anthony.Lecture notes in computer science. 2001, pp 544-555, issn 0302-9743, isbn 3-540-42464-4Conference Paper

A logic programming language based on binding algebrasHAMANA, Makoto.Lecture notes in computer science. 2001, pp 243-262, issn 0302-9743, isbn 3-540-42736-8Conference Paper

Converting untyped formulas to typed onesVAN DEN BUSSCHE, J; CABIBBO, L.Acta informatica. 1998, Vol 35, Num 8, pp 637-643, issn 0001-5903Article

Sloman's view of Gödel's sentenceBOJADZIEV, D.Artificial intelligence. 1995, Vol 74, Num 2, pp 389-393, issn 0004-3702Article

λμ-calculus and duality : Call-by-name and call-by-valueROCHETEAU, Jérome.Lecture notes in computer science. 2005, pp 204-218, issn 0302-9743, isbn 3-540-25596-6, 15 p.Conference Paper

What can spider diagrams say?STAPLETON, Gem; HOWSE, John; TAYLOR, John et al.Lecture notes in computer science. 2004, pp 112-127, issn 0302-9743, isbn 3-540-21268-X, 16 p.Conference Paper

Towards first-order temporal resolutionDEGTYAREV, Anatoli; FISHER, Michael.Lecture notes in computer science. 2001, pp 18-32, issn 0302-9743, isbn 3-540-42612-4Conference Paper

ACM-SIGACT-SIGMOD-SIGART symposium on principles of database systemsSAGIV, Yehoshua.Journal of computer and system sciences (Print). 1995, Vol 51, Num 1, issn 0022-0000, 134 p.Conference Proceedings

An approach to default reasoning based on a first-order conditional logic: revised reportDELGRANDE, J. P.Artificial intelligence. 1988, Vol 36, Num 1, pp 63-90, issn 0004-3702Article

A uniform method for proving lower bounds on the computational complexity of logical theoriesCOMPTON, K. J; WARD HENSON, C.Annals of pure and applied logic. 1990, Vol 48, Num 1, pp 1-79, issn 0168-0072, 79 p.Article

Inference of termination conditions for numerical loops in prologSEREBRENIK, Alexander; DE SCHREYE, Danny.Lecture notes in computer science. 2001, pp 654-668, issn 0302-9743, isbn 3-540-42957-3Conference Paper