Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • logic programs and the completeness of SLDNF-resolution 1992-06-26 Paper A completeness theorem for SLDNF resolution 1989-01-01 Paper...
    10 bytes (13 words) - 09:28, 24 September 2023
  • mardi4nfdi.de/entity/Q4318616 1995-01-09 Paper A new definition of SLDNF-resolution 1994-09-18 Paper Levationis Laus 1994-04-27 Paper Left termination...
    10 bytes (13 words) - 10:27, 6 October 2023
  • with respect to constraint for non-ground abducibles 1999-01-12 Paper SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs...
    10 bytes (13 words) - 08:45, 24 September 2023
  • Properties of a Pruning Operator 1990-01-01 Paper A completeness theorem for SLDNF resolution 1989-01-01 Paper Declarative error diagnosis 1987-01-01 Paper Integrity...
    10 bytes (15 words) - 07:57, 12 December 2023
  • https://portal.mardi4nfdi.de/entity/Q4499276 2001-03-05 Paper Completeness of SLDNF-resolution for nonfloundering queries 1997-11-10 Paper What is failure? An approach...
    10 bytes (13 words) - 03:36, 12 December 2023
  • Paper An intuitionistic fixed point theory 1998-12-14 Paper A note on SLDNF-resolution 1998-07-28 Paper https://portal.mardi4nfdi.de/entity/Q4364500 1998-03-23...
    10 bytes (13 words) - 22:41, 24 September 2023
  • Higher-Level Decision Making 2005-08-17 Paper The completeness of SLDNF-resolution with respect to modal completion 2002-04-09 Paper https://portal.mardi4nfdi...
    10 bytes (13 words) - 08:09, 7 October 2023
  • mardi4nfdi.de/entity/Q4265390 1999-10-12 Paper ON THE PROPOSITIONAL SLDNF-RESOLUTION 1997-08-07 Paper https://portal.mardi4nfdi.de/entity/Q4332421 1996-01-01...
    10 bytes (14 words) - 08:46, 25 September 2023
  • axiom of infinity 1995-03-05 Paper A class of programs for which \(SLDNF\) resolution and \(NAF\) rule are complete 1994-09-22 Paper A Modal Approach to...
    10 bytes (13 words) - 22:02, 24 September 2023
  • Paper https://portal.mardi4nfdi.de/entity/Q4010369 1992-09-27 Paper SLDNF-resolution with equality 1992-09-27 Paper Mints type deductive calculi for logic...
    10 bytes (15 words) - 23:10, 8 December 2023
  • mardi4nfdi.de/entity/Q4395618 1998-06-11 Paper A Completeness Result for SLDNF-Resolution 1993-06-29 Paper https://portal.mardi4nfdi.de/entity/Q4002997 1992-09-18...
    10 bytes (13 words) - 11:21, 14 March 2024
  • Publication Date of Publication Type The completeness of SLDNF-resolution with respect to modal completion 2002-04-09 Paper https://portal.mardi4nfdi...
    10 bytes (13 words) - 11:42, 7 October 2023
  • programming and negation: A survey 1994-10-13 Paper A new definition of SLDNF-resolution 1994-09-18 Paper A declarative approach for first-order built-in's...
    10 bytes (17 words) - 23:04, 11 December 2023
  • completeness theorem for SLDNF resolution πŸ‘ πŸ‘Ž ON THE PROPOSITIONAL SLDNF-RESOLUTION πŸ‘ πŸ‘Ž A direct proof of the completeness of SLDNF-resolution πŸ‘ πŸ‘Ž Applying...
    15 bytes (314 words) - 09:27, 30 January 2024
  • completeness of SLDNF-resolution πŸ‘ πŸ‘Ž ON THE PROPOSITIONAL SLDNF-RESOLUTION πŸ‘ πŸ‘Ž A direct proof of the completeness of SLDNF-resolution πŸ‘ πŸ‘Ž A Completeness...
    15 bytes (308 words) - 21:37, 3 February 2024
  • completeness theorem for SLDNF resolution πŸ‘ πŸ‘Ž ON THE PROPOSITIONAL SLDNF-RESOLUTION πŸ‘ πŸ‘Ž A direct proof of the completeness of SLDNF-resolution πŸ‘ πŸ‘Ž Applying...
    15 bytes (329 words) - 23:46, 29 January 2024
  • completeness of SLDNF-resolution πŸ‘ πŸ‘Ž A completeness theorem for SLDNF resolution πŸ‘ πŸ‘Ž A direct proof of the completeness of SLDNF-resolution πŸ‘ πŸ‘Ž A Completeness...
    15 bytes (760 words) - 16:57, 2 February 2024
  • completeness theorem for SLDNF resolution πŸ‘ πŸ‘Ž ON THE PROPOSITIONAL SLDNF-RESOLUTION πŸ‘ πŸ‘Ž A direct proof of the completeness of SLDNF-resolution πŸ‘ πŸ‘Ž A Completeness...
    15 bytes (211 words) - 02:32, 1 February 2024
  • relations between stable and well-founded semantics of logic programs SLDNF resolution with non-safe rule and fixpoint semantics for general logic programs...
    15 bytes (387 words) - 09:52, 31 January 2024
  • base and Reiter's closed world assumption A Completeness Result for SLDNF-Resolution Commonsense axiomatizations for logic programs A mathematical definition...
    15 bytes (268 words) - 12:15, 1 February 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)