Logic programs using semantic trees

被引：0
|
作者：
Maniu, Ionela [1 ]
Hunyadi, Daniel [1 ]
Maniu, George [2 ]
机构：
[1] Lucian Blaga Univ, Dept Comp Sci, Sibiu, Romania
[2] Spiru Haret Univ, Dept Management, Brasov, Romania
来源：
PROCEEDING OF THE 11TH WSEAS INTERNATIONAL CONFERENCE ON COMPUTERS: COMPUTER SCIENCE AND TECHNOLOGY, VOL 4 | 2007年
关键词：
logic programming; negation as failure; formal negation; program trees; semantic trees; bounded trail property;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In order to design software that is intended to compute answers to queries that are in accordance with some logic programming semantics, one would like to offer up a formal specification of the software design which could be used profitably to construct the software, and one would want to be able to prove that the specification is in fact faithful to the semantics. This paper presents a constructive formal specification of semantic trees and truth value determinations using semantic trees for disjunctive logic programs with negation as failure. This specification methodology directly supports the design of top-down interpreters for well-founded semantics.
引用
收藏
页码：355 / +
页数：2
相关论文
共 50 条
  • [31] TRANSFORMING NORMAL LOGIC PROGRAMS TO CONSTRAINT LOGIC PROGRAMS
    KANCHANASUT, K
    STUCKEY, PJ
    THEORETICAL COMPUTER SCIENCE, 1992, 105 (01) : 27 - 56
  • [32] Hybrid probabilistic logic programs as residuated logic programs
    Damásio C.V.
    Pereira L.M.
    Studia Logica, 2002, 72 (1) : 113 - 138
  • [33] Hybrid Probabilistic logic programs as residuated logic programs
    Damásio, CV
    Pereira, LM
    LOGICS IN ARTIFICIAL INTELLIGENCE, 2000, 1919 : 57 - 72
  • [34] From partition trees to semantic trees
    Giro, Xavier
    Marques, Ferran
    MULTIMEDIA CONTENT REPRESENTATION, CLASSIFICATION AND SECURITY, 2006, 4105 : 306 - 313
  • [35] Top-k retrieval in description logic programs under vagueness for the Semantic Web
    Lukasiewicz, Thomas
    Straccia, Umberto
    SCALABLE UNCERTAINTY MANAGEMENT, PROCEEDINGS, 2007, 4772 : 16 - +
  • [36] Translating OWL and semantic web rules into prolog: Moving toward description logic programs
    Samuel, Ken
    Obrst, Leo
    Stoutenberg, Suzette
    Fox, Karen
    Franklin, Paul
    Johnson, Adrian
    Laskey, Ken
    Nichols, Deborah
    Lopez, Steve
    Peterson, Jason
    THEORY AND PRACTICE OF LOGIC PROGRAMMING, 2008, 8 : 301 - 322
  • [37] Proof explanation for the Semantic Web using defeasible logic
    Antoniou, Grigoris
    Bikakis, Antonis
    Dimaresis, Nikos
    Genetzakis, Manolis
    Georgalis, Giannis
    Governatori, Guido
    Karouzaki, Efie
    Kazepis, Nikolas
    Kosmadakis, Dimitris
    Kritsotakis, Manolis
    Lilis, Giannis
    Papadogiannakis, Antonis
    Pediaditis, Panagiotis
    Terzakis, Constantinos
    Theodosaki, Rena
    Zeginis, Dirnitris
    KNOWLEDGE SCIENCE, ENGINEERING AND MANAGEMENT, 2007, 4798 : 186 - +
  • [38] Semantic indexing in image retrieval using description logic
    Di Sciascio, E
    Donini, FM
    Mongiello, M
    ITI 2000: PROCEEDINGS OF THE 22ND INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY INTERFACES, 2000, : 125 - 132
  • [39] Computing Logic Programs with Ordered Disjunction Using asprin
    Lee, Joohyung
    Yang, Zhun
    SIXTEENTH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2018, : 57 - 61
  • [40] OPTIMIZATION OF LINEAR LOGIC PROGRAMS USING COUNTING METHODS
    GRECO, S
    ZANIOLO, C
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 580 : 72 - 87
12345