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 条
  • [41] ABSTRACT INTERPRETATION OF LOGIC PROGRAMS USING MAGIC TRANSFORMATIONS
    DEBRAY, S
    RAMAKRISHNAN, R
    JOURNAL OF LOGIC PROGRAMMING, 1994, 18 (02): : 149 - 176
  • [42] Formal Verification of Ladder Logic programs using NuSMV
    Kottler, Sam
    Khayamy, Mehdy
    Hasan, Syed Rafay
    Elkeelany, Omar
    SOUTHEASTCON 2017, 2017,
  • [43] Protein fold discovery using stochastic logic programs
    Chen, Jianzhong
    Kelley, Lawrence
    Muggleton, Stephen
    Sternberg, Michael
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2008, 4911 LNAI : 244 - 262
  • [44] Compilation of disjunctive logic programs using an extended WAM
    Shin, DH
    Hilton, ML
    TWENTIETH ANNUAL INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE (COMPSAC'96), PROCEEDINGS, 1996, 20 : 138 - 144
  • [45] Using an abstract representation to specialize functional logic programs
    Albert, E
    Hanus, M
    Vidal, G
    LOGIC FOR PROGRAMMING AND AUTOMATED REASONING, PROCEEDINGS, 2000, 1955 : 381 - 398
  • [46] USING TEMPORAL LOGIC SPECIFICATIONS TO DEBUG PARALLEL PROGRAMS
    FREY, M
    WEININGER, A
    MICROPROCESSING AND MICROPROGRAMMING, 1993, 39 (2-5): : 97 - 100
  • [47] A Counting Logic for Trees
    Barcenas, Everardo
    COMPUTACION Y SISTEMAS, 2015, 19 (02): : 407 - 422
  • [48] Semantic segmentation and quantification of trees in an orchard using UAV orthophoto
    Akca, Seyma
    Polat, Nizar
    EARTH SCIENCE INFORMATICS, 2022, 15 (04) : 2265 - 2274
  • [49] Semantic segmentation and quantification of trees in an orchard using UAV orthophoto
    Seyma Akca
    Nizar Polat
    Earth Science Informatics, 2022, 15 : 2265 - 2274
  • [50] Using decision trees to infer semantic functions of attribute grammars
    Zvada, Szilvia
    Gyimóthy, Tibor
    Acta Cybernetica, 2001, 15 (02): : 279 - 304
12345