"Approximating the Success Set of Logic Programs Using Constrained Regular ..."

Lee Naish (2003)

> Home

Details and statistics

DOI: —

access: open

type: Conference or Workshop Paper

metadata version: 2021-02-10

- view
  - electronic edition @ westernsydney.edu.au (open access)
- export record
  dblp key:
  - conf/acsc/Naish03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/acsc/Naish03
Lee Naish:
Approximating the Success Set of Logic Programs Using Constrained Regular Types. ACSC 2003: 61-67

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.