Among various approaches to explication of Data-Information-Knowledge-Wisdom Hierarchy (DIKW) we advocate a logic-oriented approach. It stems from analysis of the notion of wisdom which often is understood as the abil...
详细信息
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. this extension supports a convenient formulation of certain problems,...
详细信息
ISBN:
(纸本)3540206426
We equip ordered logic programs with negation as failure, using a simple generalization of the preferred answer set semantics for ordered programs. this extension supports a convenient formulation of certain problems, which is illustrated by means of an intuitive simulation of logicprogramming with ordered disjunction. the simulation also supports a broader application of "ordered disjunction", handling problems that would be cumbersome to express using ordered disjunction logic programs. Interestingly, allowing negation as failure in ordered logic programs does not yield any extra computational power: the combination of negation as failure and order can be simulated using order (and true negation) alone.
Justification is the process of computing an evidence for the truth or falsity of an answer to a query in a logic program. there are two well known approaches for computing the evidence: Post-processing based techniqu...
ISBN:
(纸本)3540206426
Justification is the process of computing an evidence for the truth or falsity of an answer to a query in a logic program. there are two well known approaches for computing the evidence: Post-processing based techniques that use tabling engine [3,1] and trace-based techniques such as 4-port debuggers.
Program changes take up a substantial part of the entire programming effort. Often a preliminary step of improving the design without altering the external behaviour can be recommended. this is the idea behind refacto...
ISBN:
(纸本)3540206426
Program changes take up a substantial part of the entire programming effort. Often a preliminary step of improving the design without altering the external behaviour can be recommended. this is the idea behind refactoring, a source-to-source program transformation that recently came to prominence in the OO-community [1]. Unlike the existing results on automated program transformation, refactoring does not aim at transforming the program entirely automatically. the decision on whether the transformation should be applied and how it should be done is left to the program developer. However, providing automated support for refactoring is useful and an important challenge.
Block-based programming languages are often used as a starting point in teaching children to program. these languages provide a simplified entry point into programming;they are popular for teaching children how to pro...
详细信息
ISBN:
(纸本)9781665482530
Block-based programming languages are often used as a starting point in teaching children to program. these languages provide a simplified entry point into programming;they are popular for teaching children how to program robots. However, most studies have focused on children's engagement, enjoyment and learning rather than how children explore a block-based programming environment. this paper provides some preliminary results from how children use a programming environment for a Nao robot. these results show children initially focus on short, external manifestations, such as getting the robot to speak and move, rather than exploring the available functionality. Very few children explore the full functionality available.
We introduce HEX programs, which are nonmonotonic logic programs admitting higher-order atoms as well as external atoms, and we extend the well-known answer-set semantics to this class of programs. Higher-order featur...
详细信息
We introduce HEX programs, which are nonmonotonic logic programs admitting higher-order atoms as well as external atoms, and we extend the well-known answer-set semantics to this class of programs. Higher-order features are widely acknowledged as useful for performing meta-reasoning, among other tasks. Furthermore, the possibility to exchange knowledge with external sources in a fully declarative framework such as Answer-Set programming (ASP) is nowadays important, in particular in view of applications in the Semantic Web area. through external atoms, HEX programs can model some important extensions to ASP, and are a useful KR tool for expressing various applications. Finally, complexity and implementation issues for a preliminary prototype are discussed.
Introducing young children to robotics programming can be difficult. Children have to learn not only how to program but also how to use the components of a computer (e.g. keyboard and mouse). Tangible-based programmin...
详细信息
ISBN:
(纸本)9781665482530
Introducing young children to robotics programming can be difficult. Children have to learn not only how to program but also how to use the components of a computer (e.g. keyboard and mouse). Tangible-based programming languages provide an alternate approach as children can focus directly on learning programming. However, there are no guidelines on how to produce tangible programming languages. this paper reports on our attempt to develop and evaluate such a language. Designing a tangible language requires a trade-off between completeness and complexity in the language, with designers aiming to reduce complexity while increasing completeness. Most participants agreed that using colour helped the language, but all other features had mixed results.
the proceedings contain 3 papers. the special focus in this conference is on logic-based methods in programming Environments. the topics include: logic-based LSC Consistency Checking;Towards Parameterized Regular Type...
the proceedings contain 3 papers. the special focus in this conference is on logic-based methods in programming Environments. the topics include: logic-based LSC Consistency Checking;Towards Parameterized Regular Type Inference Using Set Constraints and the Full Abstraction Problem for Higher Order Functional-logic Programs.
Tabling has emerged as an important evaluation technique in logicprogramming. Currently, changes to a program (due to addition/deletion of rules/facts) after query evaluation compromise the completeness and soundness...
详细信息
ISBN:
(纸本)3540206426
Tabling has emerged as an important evaluation technique in logicprogramming. Currently, changes to a program (due to addition/deletion of rules/facts) after query evaluation compromise the completeness and soundness of the answers in the tables. this paper presents incremental algorithms for maintaining the freshness of tables upon addition or deletion of facts. Our algorithms improve on existing materialized view maintenance algorithms and can be easily extended to handle changes to rules as well. We describe an implementation of our algorithms in the XSB tabled logicprogramming system. Preliminary experimental results indicate that our incremental algorithms are efficient. Our implementation represents a first step towards building a practical system for incremental evaluation of tabled logic programs.
We present a higher-order term indexing strategy based on substitution trees. the strategy is based in linear higher-order patterns where computationally expensive parts are delayed. Insertion of terms into the index ...
详细信息
ISBN:
(纸本)3540206426
We present a higher-order term indexing strategy based on substitution trees. the strategy is based in linear higher-order patterns where computationally expensive parts are delayed. Insertion of terms into the index is based on computing the most specific linear generalization of two linear higher-order patterns. Retrieving terms is based on matching two linear higher-order patterns. this indexing structure is implemented as part of the Twelf system to speed-up the execution of the tabled higher-logicprogramming interpreter. Experimental results show substantial performance improvements, between 100% and over 800%.
暂无评论