Filters








197,007 Hits in 4.1 sec

Specifying Logic Programs in Controlled Natural Language [article]

Norbert E. Fuchs, Rolf Schwitter (Department of Computer Science, University of Zurich)
1995 arXiv   pre-print
Specifications in controlled natural language are automatically translated into Prolog clauses, hence become formal and executable.  ...  Controlled natural language is a subset of natural language that can be accurately and efficiently processed by a computer, but is expressive enough to allow natural usage by non-specialists.  ...  Users compose specifications for logic programs in controlled natural language that are automatically translated into Prolog clauses.  ... 
arXiv:cmp-lg/9507009v1 fatcat:mvqy5asa3fapvih6yhgbfpgozq

Specifying and Verbalising Answer Set Programs in Controlled Natural Language

ROLF SCHWITTER
2018 Theory and Practice of Logic Programming  
AbstractWe show how a bi-directional grammar can be used to specify and verbalise answer set programs in controlled natural language.  ...  We start from a program specification in controlled natural language and translate this specification automatically into an executable answer set program.  ...  In this paper, we show how such a bi-directional grammar can be built in form of a logic program for a controlled natural language.  ... 
doi:10.1017/s1471068418000327 fatcat:zslnzudwevgy7je3j3gvszyzpy

A Controlled Natural Language Layer for the Semantic Web [chapter]

Rolf Schwitter
2005 Lecture Notes in Computer Science  
In this paper, I will show how a controlled natural language can be used to describe knowledge for the Semantic Web and discuss the formal properties of this language.  ...  The controlled natural language can be used to make assertional and terminological statements as well as to specify rules for reasoning with the resulting assertional and terminological knowledge.  ...  Conditional Statements in Controlled Natural Language As already mentioned, the description logic programming language L0 allows us to work with rules.  ... 
doi:10.1007/11589990_45 fatcat:dpxtgcnmdjcz7oilc3bv7uefsu

Page 141 of Journal of Research and Practice in Information Technology Vol. 18, Issue 3 [page]

1986 Journal of Research and Practice in Information Technology  
In METALOG, control infor- mation, specified in another logic program, is viewed as meta-knowledge.  ...  CML CML (abbreviation for control meta-language) is a meta-language for controlling the derivation process in Horn clause logic programs (Gallaire and Lasserre, 1979).  ... 

Towards Provably Correct Code Generation via Horn Logical Continuation Semantics [chapter]

Qian Wang, Gopal Gupta, Michael Leuschel
2005 Lecture Notes in Computer Science  
In this paper we explore approaches to provably correct code generation based on programming language semantics, particularly Horn logical semantics, and partial evaluation.  ...  We show that the definite clause grammar (DCG) notation can be used for specifying both the syntax and semantics of imperative languages.  ...  Acknowledgments We are grateful to Constance Heitmeyer and Elizabeth Leonard of the Naval Research Labs for providing us with the BNF grammar of SCR and the safety injection program as well as for discussions  ... 
doi:10.1007/978-3-540-30557-6_9 fatcat:w37qq7hjwvewfno2bt2cujseyy

Using Verified Data-Flow Analysis-based Optimizations in Attribute Grammars

Eric Van Wyk, Lijesh Krishnan
2007 Electronical Notes in Theoretical Computer Science  
can be used to specify data-flow analyses in this framework.  ...  analysis-based optimization on control flow or program dependency graphs.  ...  Acknowledgements: We would like to thank Derek Bodin for his efforts in implementing Silver and the anonymous reviewers for their helpful comments.  ... 
doi:10.1016/j.entcs.2006.06.020 fatcat:gj22gpwr4fdftos6cz63rpuvhq

Provably Correct Code Generation: A Case Study

Qian Wang, Gopal Gupta
2005 Electronical Notes in Theoretical Computer Science  
In this paper we present an approach to provably correct compilation based on Horn logical semantics of programming languages and partial evaluation.  ...  We also show that continuation semantics can be expressed in the Horn logical framework, and introduce Definite Clause Semantics.  ...  Acknowledgement We are grateful to Constance Heitmeyer and Elizabeth Leonard of the Naval Research Labs for providing us with the BNF grammar of SCR and the safety injection program as well as for discussions  ... 
doi:10.1016/j.entcs.2004.11.008 fatcat:kizyn2w3gjb2lc77mqxush7txy

A Case Study on Using Automata in Control Synthesis [chapter]

Thomas Hune, Anders Sandholm
2000 Lecture Notes in Computer Science  
We have used monadic second order logic over strings to specify the control automata. Specifications are translated into automata by the Mona tool.  ...  We study a method for synthesizing control programs. The method merges an existing control program with a control automaton.  ...  Specification Logic It would be nice if instead of converting the informal requirement in Section 4 into an automaton, one could write it formally in a specification formalism closer to natural language  ... 
doi:10.1007/3-540-46428-x_24 fatcat:k6x72xxzzrfldhjavttukm7mbu

Non-procedural logic programming [chapter]

Seppo Keronen
1994 Lecture Notes in Computer Science  
We present a logic programming language where both problem domain and computational knowledge are expressed in logic.  ...  A logic program in this language consists of an object-program and a number of meta-programs. The object program, a collection of formulae, is a description of the problem domain of interest.  ...  The object program and meta-programs are pure logic programs. All the Prolog meta-predicates are available in the new separate meta-language.  ... 
doi:10.1007/3-540-58025-5_56 fatcat:oybhxag6nzcqpdtyhredfsyzse

Using Automata in Control Synthesis. A Case Study

Thomas S. Hune, Anders B. Sandholm
2000 BRICS Report Series  
<br />For specifying the control automata we have used monadic second order<br />logic over strings. Using the Mona tool, specifications are translated into<br />automata.  ...  We study a method for synthesizing control programs. The<br />method merges an existing control program with a control automaton.  ...  Specification logic It would be nice if instead of converting the informal requirement in Section 4 into an automaton, one could write it formally in a specification formalism closer to natural language  ... 
doi:10.7146/brics.v7i22.20149 fatcat:wfgo6xdjnfgfxg3kqtcf3bbaf4

Editorial: Executable Temporal Logics

M. FISHER, S. KONO, M.A. ORGUN
1996 Journal of symbolic computation  
, but also as high-level programming languages in their own right.  ...  Logic-based languages have been used, not only for applications such as the animation of logical specifications, program verification, the characterization of database queries and knowledge representation  ...  It is only natural that since time plays such an important rôle in reactive systems, there are languages and systems based on ETL specifically designed for specifying and executing reactive software.  ... 
doi:10.1006/jsco.1996.0063 fatcat:gd5ga7acajcgnjt2zifl2qzvtq

Proof-based Verification of Software Defined Networks

Chen Chen, Limin Jia, Wenchao Zhou, Boon Thau Loo
2014 Open Networking Summit  
Verification of SDN is gaining attention in the last few years [1, 5] . There are two main challenges of SDN: (1) SDNs are often programmed in general-purpose programming languages (e.g.  ...  More concretely, we are interested in properties expressible as linear temporal logic formulas (LTL). Many correctness and security properties of the network can be specified in LTL.  ... 
dblp:conf/ons/ChenJZL14 fatcat:q3d4zydc65fbnllpav75aq3i2y

ChucK: A Strongly Timed Computer Music Language

Ge Wang, Perry R. Cook, Spencer Salazar
2015 Computer Music Journal  
In particular, ChucK defines the notion of a strongly timed audio programming language, comprising a versatile time-based programming model that allows programmers to flexibly and precisely control the  ...  ChucK is a programming language designed for computer music.  ...  control over time and concurrency in the language.  ... 
doi:10.1162/comj_a_00324 fatcat:whk57pjpbzaufbbb5dxn7bj33m

Controlled Natural Languages for Knowledge Representation and Reasoning

Tiantian Gao, Marc Herbstritt
2016 International Conference on Logic Programming  
Controlled natural languages (CNLs) are effective languages for knowledge representation and reasoning. They are designed based on certain natural languages with restricted lexicon and grammar.  ...  In this paper, it mainly focuses on a class of CNLs, called machine-oriented CNLs, which have well-defined semantics that can be deterministically translated into formal languages to do logical reasoning  ...  Introduction Controlled natural languages (CNLs) are effective languages for knowledge representation and reasoning.  ... 
doi:10.4230/oasics.iclp.2016.19 dblp:conf/iclp/Gao16 fatcat:xy4yevuubzbwhaw2uwvbt5vaz4

Implementing tactics and tacticals in a higher-order logic programming language

Amy Felty
1993 Journal of automated reasoning  
We argue that a logic programming language with a higher-order intuitionistic logic as its foundation can be used both to naturally specify and implement tactic style theorem provers.  ...  Tactics and tacticals, which provide a framework for high-level control over search for proofs, can be directly and naturally implemented in the extended language.  ...  This research was supported in part by grants ARO-DAA29-84-9-0027, ONR N00014-88-K-0633, NSF CCR-87-05596, DARPA N00014-85-K-0018, and ESPRIT Basic Research Action 3245.  ... 
doi:10.1007/bf00881900 fatcat:plrrvswjzzhntakfcpmfvap75m
« Previous Showing results 1 — 15 out of 197,007 results