Revising Undefinedness in the Well-Founded Semantics of Logic Programs
The Well-Founded Semantics (WFS) for normal logic programs associates with each program one single model expressing truth, falsity and undefinedness of atoms. Under the WFS, atoms are said to be undefined if: • Either are part of a two-valued choice (true in some worlds, false in others) but never u...
| Autor principal: | |
|---|---|
| Formato: | masterThesis |
| Idioma: | eng |
| Publicado em: |
2019
|
| Assuntos: | |
| Texto completo: | http://hdl.handle.net/10362/68741 |
| País: | Portugal |
| Oai: | oai:run.unl.pt:10362/68741 |