Filters








11,650 Hits in 10.1 sec

S: A machine readable specification notation based on higher order logic [chapter]

J. Joyce, N. Day, M. Donat
1994 Lecture Notes in Computer Science  
This paper introduces a new notation called S which is based on higher order logic.  ...  In addition to providing an introduction to S, this paper describes a public domain software tool called "Fuss" which has been implemented to support the use of S as a specification language.  ...  Acknowledgements In addition to the authors of this paper, work was completed on this project by S. Kahan, M. Wong Cheng In, and Z. Zhu. This work has been supported by funds from the B.C.  ... 
doi:10.1007/3-540-58450-1_49 fatcat:fesxu74t7rahla3ejodgiijd24

Efficiently Querying RDF(S) Ontologies with Answer Set Programming

G. Ianni, A. Martello, C. Panetta, G. Terracina
2008 Journal of Logic and Computation  
Then, based on a previous result showing that the SPARQL query language (a candidate W3C recommendation for RDF(S) ontologies) can be mapped to a rule-based language, it shows that efficient querying of  ...  This work is a first step toward this setting: it first shows that RDF(S) ontologies can be expressed, without loss of semantics, into Answer Set Programming (ASP).  ...  OWL is based on description logics [5] .  ... 
doi:10.1093/logcom/exn043 fatcat:mfx34qrpebf27kgyfhqy3cufoy

A Conceptual Comparison of WSMO and OWL-S [chapter]

Rubén Lara, Dumitru Roman, Axel Polleres, Dieter Fensel
2004 Lecture Notes in Computer Science  
In this paper, we conduct a conceptual comparison that identifies the overlaps and differences of both initiatives in order to evaluate their applicability in a real setting and their potential to become  ...  Web Services have added a new level of functionality on top of current Web, enabling the use and combination of distributed functional components within and across company boundaries.  ...  Thus, in future versions of WSMO it is intended to have a rich notion of state and state transition based on an Abstract State Machines-like notation..  ... 
doi:10.1007/978-3-540-30209-4_19 fatcat:3hf4dvjr4jgajij6u6d6zqq2jy

PVS: Combining specification, proof checking, and model checking [chapter]

S. Owre, S. Rajan, J. M. Rushby, N. Shankar, M. Srivas
1996 Lecture Notes in Computer Science  
Model checking is one such decision procedure that is used to discharge temporal properties of specific finite-state systems.  ...  PVS (Prototype Verification System) is an environment for constructing clear and precise specifications and for developing readable proofs that have been mechanically verified.  ...  Combining Theorem Proving and Typechecking The PVS specification language is based on classical, simply typed higher-order logic, but the type system has been augmented with subtypes and dependent types  ... 
doi:10.1007/3-540-61474-5_91 fatcat:z6kgpm7gdbd3fnyyrsz4apa7gy

Natural Language Specifications in Proof Assistants [article]

Colin S. Gordon, Sergey Matskevich
2022 arXiv   pre-print
This is especially problematic when using proof assistants to formally verify the correctness of software with respect to a natural language specification.  ...  This paper argues that it is possible to build support for natural language specifications within existing proof assistants, in a way that complements the principles used to establish trust and auditability  ...  When a function is called that relies on a set of operations, Coq attempts to use higher-order unification to construct an appropriate implementation.  ... 
arXiv:2205.07811v1 fatcat:jc4on2o4dfdjfnr2yrcjbdujye

Symbolic AI for XAI: Evaluating LFIT Inductive Programming for Explaining Biases in Machine Learning

Alfonso Ortega, Julian Fierrez, Aythami Morales, Zilong Wang, Marina de la Cruz, César Luis Alonso, Tony Ribeiro
2021 Computers  
In these domains, white-box (human-readable) explanations of systems built on machine learning methods become crucial.  ...  scenario: fair recruitment based on an automatic tool generated with machine learning methods for ranking Curricula Vitae that incorporates soft biometric information (gender and ethnicity).  ...  Logic programming is based on first-order logic that is a standard model to represent human knowledge.  ... 
doi:10.3390/computers10110154 fatcat:nk7xdcwwunhurftvwwphqrob74

APL as a Software Design Specification Language

W. T. Jones, S. A. Kirk
1980 Computer journal  
A follow-up to the proposal to introduce higher order arrays, assignment (symbols '<-') should be allowed to operate on an array of arrays. 8.  ...  First, APL is in widespread usage and has been implemented to varying extents on many machines.  ... 
doi:10.1093/comjnl/23.3.230 fatcat:y4f5iyggv5fsbpohlcrwqknhxi

General Chairman's Message

1986 MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's  
Acknowledgment Acknowledgments Sincere thanks to NASA Code Q and NASA Code S for funding this work.  ...  Finally PGL would like to thank John Kelly for asking for review comments on [9].  ...  PVS offers both a very expressive specification language based on higher order logic and a powerful theorem prover.  ... 
doi:10.1109/milcom.1986.4805639 fatcat:yv3yt6hivvg4bjtj5ftdxp7dke

General Chairman's Message

1986 MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's  
Acknowledgment Acknowledgments Sincere thanks to NASA Code Q and NASA Code S for funding this work.  ...  Finally PGL would like to thank John Kelly for asking for review comments on [9].  ...  PVS offers both a very expressive specification language based on higher order logic and a powerful theorem prover.  ... 
doi:10.1109/milcom.1986.4805724 fatcat:ywopnvuobzd7nfg5vqbicn6wcy

General Chairman's Message

1986 MILCOM 1986 - IEEE Military Communications Conference: Communications-Computers: Teamed for the 90's  
Acknowledgment Acknowledgments Sincere thanks to NASA Code Q and NASA Code S for funding this work.  ...  Finally PGL would like to thank John Kelly for asking for review comments on [9].  ...  PVS offers both a very expressive specification language based on higher order logic and a powerful theorem prover.  ... 
doi:10.1109/milcom.1986.4805808 fatcat:45cvhs7md5gupdkd4rckkqy3qm

Requirements specification for process-control systems

N.G. Leveson, M.P.E. Heimdahl, H. Hildreth, J.D. Reese
1994 IEEE Transactions on Software Engineering  
using a specification language that is readable and reviewable by application experts who are not computer scientists or mathematicians.  ...  The example specification demonstrates 1) the practicality of writing a formal requirements specification for a complex, process-control system, and 2) the feasibility of building a formal model of a system  ...  effect on readability.  ... 
doi:10.1109/32.317428 fatcat:jead5qnj3bapxhzqlg7sq6qp7u

A survey of semantic description frameworks for programming languages

Yingzhou Zhang, Baowen Xu
2004 SIGPLAN notices  
To add a base on predicate logic.  ...  [Rep1991] Reppy, J., CML: a higher-order concurrent language. In: [Mou1993] Moura, H.P., Action notation transformations [Ph.D.  ... 
doi:10.1145/981009.981013 fatcat:aq23dovoqvdgzdo5xz7vclcnoe

A Defense of (s)crappy Robots [article]

Ryan Jenkins, Mairéad Hurley, Eva Durall, Sebastian Martin
2020 Zenodo  
Participants will collaborate with others on the design of the machine and share their prototype with the rest of the group.  ...  We're also concerned with the possibility that the approach and aesthetic qualities of these products tend to be directed to specific groups thus creating a less inclusive environment.  ...  The activity in this paper showed just one approach to using ML-ABM in education: to increase complexity by adding a level in the form of a model.  ... 
doi:10.5281/zenodo.5501878 fatcat:snjtztj37fbbpeszscwhk63uj4

A dictionary of documentation terms

Frank S. Wagner JR.
1960 American Documentation  
MACHINE LANGUAGE. (1) Linguistic or nu- merical patterns susceptible of being :andled by data processing equipment. (2) A special type of notation used for a specific data processing machine. (3) A method  ...  ORDER, n. (1) The number of successive char- acteristics needed to derive a specific iso- late or class from its primordial universe. (used by S. R.  ... 
doi:10.1002/asi.5090110204 fatcat:kdak2xe2rnghfdbqnjq7nf4lsu

Security protocols over open networks and distributed systems: formal methods for their analysis, design, and verification

S Gritzalis, D Spinellis, P Georgiadis
1999 Computer Communications  
Modern high-level specification languages and tools can be used for automatically analysing cryptographic protocols.  ...  Recent research work focuses on the ex-ante use of formal methods in the design state of new security protocols, as the synthesis approach.  ...  A Higher Order Logic (HOL) theory [62] formalising an extended version of GNY, named BGNY logic has been introduced by Brackin [8] .  ... 
doi:10.1016/s0140-3664(99)00030-4 fatcat:cv3vmaztf5drxc2edllnfgefva
« Previous Showing results 1 — 15 out of 11,650 results