The aim of our paper is to show how various reasoning puzzles can be used to teach the ICT students the craft of programming. We have described several reasoning puzzles here together with various approaches to solve ...
详细信息
ISBN:
(纸本)9781665484428
The aim of our paper is to show how various reasoning puzzles can be used to teach the ICT students the craft of programming. We have described several reasoning puzzles here together with various approaches to solve them. The individual algorithms allow us to show the typical mistakes and inefficiencies that students usually do when solving the problem. While the puzzles are easy to be defined and explained, they represent reasonably difficult problems to be solved by naive algorithms. Students are guided through the process of development of more efficient algorithms, they learn the important principles of dealing with generate and test problems, and the basic rules to be remembered are formulated there. The programs are written in Prolog and we discuss the reasons for the utilisation of this programming language in our paper too. Nevertheless, it has been stressed that the principles described here are valid generally and regardless the choice of programming language.
This paper 1) provides an introduction to logic programming for structural engineering applications and 2) explicates the advantages of logic programming compared with conventional procedural programming. Mathematical...
详细信息
ISBN:
(纸本)0784400768
This paper 1) provides an introduction to logic programming for structural engineering applications and 2) explicates the advantages of logic programming compared with conventional procedural programming. Mathematical logic, the basis of logic programming, is introduced and its use in structural engineering is exemplified using a simple problem. The syntax and semantics as well as the representation and manipulation aspects of logic programming are discussed and illustrated. Several logic-based computing tools and techniques that are suitable for engineering applications are identified, and the emerging trends in logic programming are briefly mentioned.
The size of the Web and its increase rate made it cumbersome to locate high precision results to a requested piece of information. The Semantic Web provides a framework and a set of technologies enabling an effective ...
详细信息
ISBN:
(纸本)9780769530260
The size of the Web and its increase rate made it cumbersome to locate high precision results to a requested piece of information. The Semantic Web provides a framework and a set of technologies enabling an effective machine processable information, aiming at a better computer-computer and human-computer communication. What if though, we use a both machine processable and human understandable approach which can also apply in existent HTML Web sources? In this work, we investigate the problems being solved with the Semantic Web technologies and how this can be coped with logic programming techniques, especially Modular logic programming. We discuss issues from the data level, metadata and reasoning. Last but not least, we discuss agents. What is more is that, we claim that these techniques can be applied in the current Web information sources providing formal semantics for some aspects of the traditional Web.
We propose an approach to combining logic programming and knowledge representation paradigms. This approach is based on the conception of description terms. LP and KR are integrated in such a way that their underlying...
详细信息
ISBN:
(纸本)3540366350
We propose an approach to combining logic programming and knowledge representation paradigms. This approach is based on the conception of description terms. LP and KR are integrated in such a way that their underlying logics are carefully separated. A core idea here is to push the KR techniques on the functional level. On the LP level the knowledge base is considered as a constraint store, in which special propagation methods are ruling. A constraint logic programming language based on this idea is outlined.
It is argued that some symmetric structure in logic programs could be taken into account when implementing semantics in logic programming. This may enhance the declarative ability or expressive power of the semantics....
详细信息
It is argued that some symmetric structure in logic programs could be taken into account when implementing semantics in logic programming. This may enhance the declarative ability or expressive power of the semantics. The work presented here may be seen as representative examples along this line. The focus is on the derivation of negative information and some other classic semantic issues. We first define a permutation group associated with a given logic program. Since usually the canonical models used to reflect the common sense or intended meaning are minimal or completed models of the program, we expose the relationships between minimal models and completed models of the original program and its so-called G-reduced form newlt-derived via the permutation group defined. By means of this G reduced form, we introduce a rule to assume negative information termed G-CWA, which is actually a generalization of the GCWA. We also develop the notions of G-definite, G-hierarchical and G-stratified logic programs, which are more general than definite, hierarchical and stratified programs, and extend some well-known declarative and procedural semantics to them, respectively.
Keywords symmetry - logic programming - semantics
Partially supported by the National Natural Science Foundation of China under Grant No.60373113.
Jin-Zhao Wu was born in 1965. He obtained his Ph.D. degree in 1994 from the Institute of Systems Science, the Chinese Academy of Sciences. From 1994 to 1999 he was a post-doctoral and research scientist in Peking University and Max-Planck Institute of Computer Science. Since 2000 he has been working on the Faculty of Mathematics and Computer Science, University of Mannheim.
Harald Fecher was born in 1972. He obtained his Ph.D. degree in 2003 from the Faculty of Mathematics and Computer Science, University of Mannheim. Since 2004 he has been research scientist in the Faculty of Computer Science, University of Kiel.
The growing size of electronically available text corpora like comparties' intranets or the WWW has made information access a hot topic within Computational Linguistics. Despite the success of statistical or keywo...
详细信息
ISBN:
(数字)9783540302278
ISBN:
(纸本)3540232427
The growing size of electronically available text corpora like comparties' intranets or the WWW has made information access a hot topic within Computational Linguistics. Despite the success of statistical or keyword based methods, deeper Knowledge Representation (KR) techniques along with "inference" are often mentioned as mandatory, e.g. within the Semantic Web context, to enable e.g. better query answering based on "semantical" information. In this paper we try to contribute to the open question how to operationalize semantic information on a larger scale. As a basis we take the frame structures of the Berkeley FrameNet II project, which is a structured dictionary to explain the meaning of words from a lexicographic perspective. Our main contribution is a transformation of the FrameNet II frames into the answer set programming paradigm of logic programming. Because a number of different reasoning tasks are subsumed under "inference" in the context of natural language processing, we emphasize the flexibility of our transformation. Together with methods for automatic annotation of text documents with frame semantics which are currently developed at various sites, we arrive at an infrastructure that supports experimentation with semantic information access as is currently demanded for.
In recent years logic programming based languages and features such as rules and non-monotonic constructs have become important in various knowledge representation paradigms. While the early logic programming language...
详细信息
ISBN:
(纸本)9783642239625;9783642239632
In recent years logic programming based languages and features such as rules and non-monotonic constructs have become important in various knowledge representation paradigms. While the early logic programming languages, such as Horn logic programs and Prolog did not focus on expressing and reasoning with uncertainty, in recent years logic programming languages have been developed that can express both logical and quantitative uncertainty. In this paper we give an overview of such languages and the kind of uncertainty they can express and reason with. Among those, we slightly elaborate on the language P-log that not only accommodates probabilistic reasoning, but also respects causality and distinguishes observational and action updates.
Current trends in Software Engineering and developments in logic programming lead us to believe that there will be an opportunity for logic programming to make a breakthrough in Software Engineering. In this paper, we...
详细信息
ISBN:
(纸本)3540439307
Current trends in Software Engineering and developments in logic programming lead us to believe that there will be an opportunity for logic programming to make a breakthrough in Software Engineering. In this paper, we explain how this has arisen, and justify our belief with a real-life application. Above all, we invite fellow workers to take up the challenge that the opportunity offers.
This paper proposes a sequential model of bar- gaining specifying reasoning processes of an agent be- hind bargaining procedures. We encode agents＇ background knowledge, demands, and bargaining constraints in logic p...
详细信息
This paper proposes a sequential model of bar- gaining specifying reasoning processes of an agent be- hind bargaining procedures. We encode agents＇ background knowledge, demands, and bargaining constraints in logic pro- grams and represent bargaining outcomes in answer sets. We assume that in each bargaining situation, each agent has a set of goals to achieve, which are normally unachievable with- out an agreement among all the agents who are involved in the bargaining. Through an alternating-offers procedure, an agreement among bargaining agents may be reached by ab- ductive reasoning. We show that the procedure converges to a Nash equilibrium if each agent makes rational offers/counter- offers in each round. In addition, the sequential model also has a number of desirable properties, such as mutual commit- ments, individual rationality, satisfactoriness, and honesty.
This paper presents the pl-nauty library, a Prolog interface to the nauty graph-automorphism tool. Adding the capabilities of nauty to Prolog combines the strength of the "generate and prune" approach that i...
详细信息
This paper presents the pl-nauty library, a Prolog interface to the nauty graph-automorphism tool. Adding the capabilities of nauty to Prolog combines the strength of the "generate and prune" approach that is commonly used in logic programming and constraint solving, with the ability to reduce symmetries while reasoning over graph objects. Moreover, it enables the integration of nauty in existing tool-chains, such as SAT-solvers or finite domain constraints compilers which exist for Prolog. The implementation consists of two components: pl-nauty, an interface connecting nauty's C library with Prolog, and pl-gtools, a Prolog framework integrating the software component of nauty, called gtools, with Prolog. The complete tool is available as a SWI-Prolog module. We provide a series of usage examples including two that apply to generate Ramsey graphs.
暂无评论