55 Hits in 2.8 sec

Strategic directions in real-time and embedded systems

John A. Stankovic
1996 ACM Computing Surveys  
Alternate techniques such as interval arithmetic and the calculus of execution time intervals are required. The second aspect concerns the management of logical and physical concurrency in time.  ...  and graceful degradation in the presence of failures and time constraints.  ... 
doi:10.1145/242223.242291 fatcat:evt5gbvcjnfc3g3hauytxuuv6i

CYC: A Midterm Report

Ramanathan V. Guha, Douglas B. Lenat
1990 The AI Magazine  
The heuristic level consists of several modules for generating and comparing arguments for and against a given proposition.  ...  A user (human or application program) will usually communicate with Cyc at the epistemological level, and their utterances are translated by the tell-ask (TA) interface into heuristic-level propositions  ...  and testing the system.  ... 
doi:10.1609/aimag.v11i3.842 dblp:journals/aim/GuhaL90 fatcat:ntx5tuuwkzarrmqzdmk4kzdqny

Meta-modelling and graph grammars for multi-paradigm modelling in AToM3

Juan de Lara, Hans Vangheluwe, Manuel Alfonseca
2004 Journal of Software and Systems Modeling  
In meta-modelling, formalisms are described at a metalevel. This information is used by a meta-model processor to generate modelling tools for the described formalisms.  ...  Mosterman and Vangheluwe [18] introduced the term multi-paradigm modelling to denote the combination of multiple formalisms, multiple abstraction levels, and meta-modelling.  ...  Juan de Lara and Manuel Alfonseca gratefully acknowledge partial sponsorship for this work by the Spanish Ministry of Science and Technology (MCYT), project number TIC2002-01948.  ... 
doi:10.1007/s10270-003-0047-5 fatcat:vpk5s4b7ojcazjiryf45i2hg4i

Fixpoint & Proof-theoretic Semantics for CLP with Qualification and Proximity [article]

Mario Rodríguez-Artalejo, Carlos A. Romero-Díaz
2011 arXiv   pre-print
In this report we propose a new scheme SQCLP designed as an extension of CLP that supports qualification values and proximity relations.  ...  Uncertainty in Logic Programming has been investigated during the last decades, dealing with various extensions of the classical LP paradigm and different applications.  ...  The authors are thankful to the anonymous referees of (Rodríguez-Artalejo and Romero-Díaz 2010) for constructive remarks and suggestions which helped to improve the presentation.  ... 
arXiv:1009.1977v2 fatcat:dok3fmmsvnbejopogp6ylblmhi

Control Techniques for Complex Reasoning: The Case of Milord II [chapter]

Lluís Godo, Josep Puyol-Gruart, Carles Sierra
2002 Agent-Based Defeasible Control in Dynamic Environments  
To illustrate the use of such modelling techniques we present first a scheduling reasoning system, second a method for solving a general class of default reasoning problems, and finally a legal reasoning  ...  problem involving default rules and priorities.  ...  This research has also been partially supported by the Esprit Basic Research Action number 3085 (DRUMS) and by the European Community project MUM (Copernicus 10053).  ... 
doi:10.1007/978-94-017-1741-0_4 fatcat:mm63hoey2zc25fhrhftjplvx4y

80-Mb/s QPSK and 72-Mb/s 64-QAM flexible and scalable digital OFDM transceiver ASICs for wireless local area networks in the 5-GHz band

W. Eberle, V. Derudder, G. Vanwijnsberghe, M. Vergara, L. Deneire, L. Van der Perre, M.G.E. Engels, I. Bolsens, H. De Man
2001 IEEE Journal of Solid-State Circuits  
Joint development of signal processing algorithms and architectures along with on-chip data transfer, control, and partitioning leads to a low-power, yet flexible and scalable implementation.  ...  The latter partially matches the Hiperlan/2 and IEEE 802.11a standards.  ...  The receiver only uses information on the codeword length and the metalevel sequence; the codeword itself is not known.  ... 
doi:10.1109/4.962306 fatcat:u3urhi336vfkhilbliuk2zpi5e

Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules

Henning Christiansen
2009 Journal of Applied Logic  
The following program, which specifies and solves an abductive problem, is written in the syntax for chr in SICStus and swi prolog.  ...  The chr rule excludes an explanation which includes rich(peter), and thereby forcing the prolog engine to try the second clause in its eagerness to verify the query.  ...  Overall, this example is characterized by a large base of facts with a lot of abducibles being generated, with integrity constraints involving integer arithmetic, and multitudes of failed alternatives.  ... 
doi:10.1016/j.jal.2008.10.004 fatcat:vci2qqbucjawdje55gc6cxw2ge

Ultimate Cognition à la Gödel

Jürgen Schmidhuber
2009 Cognitive Computation  
All life is problem solving," said Popper.  ...  Can we formally nail down this informal statement, and derive a mathematically rigorous blueprint of ultimate cognition?  ...  Acknowledgments Thanks to Alexey Chernov, Marcus Hutter, Jan Poland, Ray Solomonoff, Sepp Hochreiter, Shane Legg, Leonid Levin, Alex Graves, Matteo Gagliolo, Viktor Zhumatiy, Ben Goertzel, Will Pearson, and  ... 
doi:10.1007/s12559-009-9014-y fatcat:yctnndvu7verhoac6zmyh3jdim

Nominal logic programming

James Cheney, Christian Urban
2008 ACM Transactions on Programming Languages and Systems  
We describe some typical nominal logic programs, and develop the model-theoretic, proof-theoretic, and operational semantics of such programs.  ...  Nominal logic is an extension of first-order logic which provides a simple foundation for formalizing and reasoning about abstract syntax modulo consistent renaming of bound names (that is, alpha-equivalence  ...  His support for me and this work has been unyielding. My other committee members, Robert Constable and Geri Gay, have also been very supportive.  ... 
doi:10.1145/1387673.1387675 fatcat:longqgnr75aktkwdy56eeyu4ne

Validation of web service compositions

L. Baresi, D. Bianculli, C. Ghezzi, S. Guinea, P. Spoletini
2007 IET Software  
. * This paper is a postprint of a paper submitted to and accepted for publication in IET Software and is subject to Institution of Engineering and Technology  ...  Based on these assertions, the composite service may be verified at design time by checking that it ensures certain relevant properties.  ...  To develop BPEL2BIR, we had to solve three main problems.  ... 
doi:10.1049/iet-sen:20070027 fatcat:jt364imlb5gvdfdwh6kflpxl2u

Early-Stage Resource Estimation from Functional Reliability Specification in Embedded Cyber-Physical Systems [article]

Ginju V. George, Aritra Hazra, Pallab Dasgupta, Partha Pratim Chakrabarti
2020 arXiv   pre-print
We use SMT (Satisfiability Modulo Theories) / ILP (Integer Linear Programming) solvers at the back end to solve the optimization problem, and demonstrate the feasibility of our methodology on a Satellite  ...  The proposed reliability specification is overlaid on the safety-critical functional specification and our methodology extracts a constraint satisfaction problem for determining the optimal set of resources  ...  Chakrabarti acknowledges the partial support from DST, India and P. Dasgupta acknowledges the partial support from FMSAFE project (under IMPRINT-India).  ... 
arXiv:2005.00995v1 fatcat:g5lc74weefct7hr6n2ui4267qy

A program logic for resources

David Aspinall, Lennart Beringer, Martin Hofmann, Hans-Wolfgang Loidl, Alberto Momigliano
2007 Theoretical Computer Science  
We also present a second logic built on top of the core logic, which is used to express termination; it too is shown to be sound and complete.  ...  We establish some important results for this logic, including soundness and completeness with respect to a resource-aware operational semantics for the JVML.  ...  The following numbers were obtained by solving these constraints manually Flatten To continue with another example program, Fig. 3 shows the definition of a method that flattens a binary tree into  ... 
doi:10.1016/j.tcs.2007.09.003 fatcat:byg7z6m3hngancztkhowx4agru

Probability Distinguishes Different Types of Conditional Statements [article]

Joseph W. Norman
2014 arXiv   pre-print
Conditionals can be specialized further by their content to express factuality and counterfactuality, and revised or reformulated to account for exceptions and confounding factors.  ...  equations and inequalities (with real coefficients).  ...  real interval [0, 1].  ... 
arXiv:1307.3802v4 fatcat:v5fbjxsuvrcermm62nlbjysdse

Interactive Realizability, Monads and Witness Extraction [article]

Giovanni Birolo
2013 arXiv   pre-print
The reduction we present are inspired by the informal idea of learning by making falsifiable hypothesis and checking them, and by the interactive realizability interpretation.  ...  (Heyting Arithmetic, HA) extended by the law of the excluded middle restricted to simply existential formulas formulas (EM1), a system motivated by its interest in proof mining.  ...  Property MR1 is a constraint on the relationship between R M and R M .  ... 
arXiv:1304.4091v1 fatcat:aosasp7xrvglraxhrmfuqwm65m

On proving confluence modulo equivalence for Constraint Handling Rules

Henning Christiansen, Maja H. Kirkeby
2016 Formal Aspects of Computing  
Previous results on proving confluence for Constraint Handling Rules are extended in two ways in order to allow a larger and more realistic class of CHR programs to be considered confluent.  ...  We have introduced a formal meta-language that allows reasoning about abstract states and derivations with meta-level restrictions that reflect the non-logical and incomplete predicates.  ...  We have demonstrated the relevance of confluence modulo equivalence for Constraint Handling Rules, which may also inspire to apply the concept to other systems with nondeterministic choice and parallelism  ... 
doi:10.1007/s00165-016-0396-9 fatcat:jpu3pmdyabgz7ewaqxw46xyfle
« Previous Showing results 1 — 15 out of 55 results