Filters








30,349 Hits in 6.2 sec

Synthesis from Temporal Specifications Using Preferred Answer Set Programming [chapter]

Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir
2005 Lecture Notes in Computer Science  
from a temporal specification.  ...  More specifically, we discuss how to obtain, using preferred ASP, concurrent programs that are as concurrent as the temporal specification allows.  ...  Preferred Answer Set Programming We introduce the extended answer set semantics as in [24] .  ... 
doi:10.1007/11560586_23 fatcat:z3vi5amfibdsfbjrkpnmtshdtq

PAYNT : A Tool for Inductive Synthesis of Probabilistic Programs [chapter]

Roman Andriushchenko, Milan Češka, Sebastian Junges, Joost-Pieter Katoen, Šimon Stupinský
2021 Computer aided verification : 33rd international conference  
PAYNT enables the synthesis of finite-state probabilistic programs from a program sketch representing a finite family of program candidates.  ...  These oracle-guided methods effectively reason about all possible candidates and synthesise programs that meet a given specification formulated as a conjunction of temporal logic constraints and possibly  ...  Here, we focus on finite-state programs and consider specifications given as (conjunction of) temporal logic constraints.  ... 
doi:10.18154/rwth-2021-09817 fatcat:jhnfn6pk3zefriecgsuauxbwjq

DNN-Based Speech Synthesis for Arabic: Modelling and Evaluation [chapter]

Amal Houidhek, Vincent Colotte, Zied Mnasri, Denis Jouvet
2018 Lecture Notes in Computer Science  
Hence, it is worth investigating if those phenomena must be handled by using specific speech units, or if their specification in the contextual features is enough.  ...  This paper investigates the use of deep neural networks (DNN) for Arabic speech synthesis.  ...  This research work was conducted under PHC-Utique Program in the framework of CMCU (Comité Mixte de Coopération Universitaire) grant N 15G1405.  ... 
doi:10.1007/978-3-030-00810-9_2 fatcat:rpdloirdeba3pnyi2m2adn5vze

Derivation of Network Reprogramming Protocol with Z3 [article]

Vidhya Tekken-Valapil, Sandeep S. Kulkarni
2017 arXiv   pre-print
Network Protocol synthesis is the process of synthesizing or deriving network specific protocols from the requirements of a given specific network.  ...  In this report, we present a step-by-step approach for the automated synthesis of network protocols from the network specifications.  ...  Computational Temporal Logic (CTL) is a widely sorted category of Temporal logic that is useful in formal specification of computer programs or systems, formal analysis, and verification of executions  ... 
arXiv:1709.06604v1 fatcat:nbwdta6bczb6vpk7xcqim4yjvu

MetateM: An introduction

H. Barringer, M. Fisher, D. Gabbay, G. Gough, R. Owens
1995 Formal Aspects of Computing  
In this paper a methodology for the use of temporal logic as an executable imperative language is introduced.  ...  ], and to present a framework, called METATEM [BFG89a], for executing temporal logics.  ...  On a related theme, there have been investigations into the synthesis of programs from temporal logic based specifications, for example [MAW84] and more recently [PnR89a, PnR89b] .  ... 
doi:10.1007/bf01211631 fatcat:xlchty7pn5gbzh6cbefuyrslxa

Combining Induction, Deduction, and Structure for Verification and Synthesis

Sanjit A. Seshia
2015 Proceedings of the IEEE  
The second is to solve the resulting synthesis problem by integrating traditional, deductive methods with inductive inference (learning from examples) using hypotheses about system structure.  ...  Chief amongst these are environment modeling, incompleteness in specifications, and the hardness of underlying decision problems.  ...  constructing concurrent programs in which the synchronization skeleton of the program is automatically synthesized from a high-level (branching time) Temporal Logic specification."  ... 
doi:10.1109/jproc.2015.2471838 fatcat:cfj3tcy3njg3debcuxzqjye2ii

Towards Neural-Guided Program Synthesis for Linear Temporal Logic Specifications [article]

Alberto Camacho, Sheila A. McIlraith
2019 arXiv   pre-print
Temporal Logic (LTL) specification.  ...  Synthesizing a program that realizes a logical specification is a classical problem in computer science.  ...  Introduction Automated synthesis of programs from logical specification-program synthesis from specificationis a classical problem in computer science that dates back to Church (1957) .  ... 
arXiv:1912.13430v1 fatcat:pfvzwhbrozge5j5sigpmc3ubpm

Automata Techniques for Temporal Answer Set Programming

Susana Hahn
2021 Electronic Proceedings in Theoretical Computer Science  
Temporal and dynamic extensions of Answer Set Programming (ASP) have played an important role in addressing dynamic problems, as they allow the use of temporal operators to reason with dynamic scenarios  ...  In my Ph.D. research, I intend to exploit the relationship between automata theory and dynamic logic to add automata-based techniques to the ASP solver CLINGO helping us to deal with theses type of problems  ...  One of the main candidates for modeling and solving problems with this type of logic is Answer Set Programming (ASP) [8] .  ... 
doi:10.4204/eptcs.345.42 fatcat:3f37xiiesbda7hhrs74amnebla

Developing new technologies for the ARPA-Rome Planning Initiative

J. Stillman, P. Bonissone
1995 IEEE Expert  
These ~ capabilities in turn require strong techno- THIS SURVEY HlGHLlGHTS SOME OF THE MANYAPA R&'D PROGRAMS THAT ARE FOCUSliVG ON TECHNOLOGY ZSSUES IN PLAN GENERATION, SCHEDULRVG AND TEMPORAL REASONZNG  ...  It is sup-I uling and temporal reasoning, plan analysis, ported by temporal reasoning, algorith-1 and the overall supporting infrastructure.  ...  For example, SIMS uses 1 retrieved from databases can be operated FEBRUARY 1995 ~~ When an approximate answer is returned, the user may want an explanation of how the answer was derived, or may be  ... 
doi:10.1109/64.391962 fatcat:2huqke6lc5hlthc4u7shcs5qoi

Executable Temporal Logic Systems

1996 Journal of symbolic computation  
Consequently, logical implication can be used to relate an ITL specification with a Tempura program that implements it.  ...  short proofs), rigidity of the time constraint (cardinality of an input time set, prefers large sets), generality of the partially instantiated goal (referenced part of substitution, prefers unbound variables  ... 
doi:10.1006/jsco.1996.0073 fatcat:irywl2eukzh6xjuqpcbfqyesri

Sciduction

Sanjit A. Seshia
2012 Proceedings of the 49th Annual Design Automation Conference on - DAC '12  
In this position paper, we contend that these challenges can be tackled by integrating traditional, deductive methods with inductive inference (learning from examples) using hypotheses about system structure  ...  Chief amongst these are environment modeling, incompleteness in specifications, and the complexity of underlying decision problems.  ...  This paper has benefited from feedback on talks on this work given by the author at several venues in 2009-11.  ... 
doi:10.1145/2228360.2228425 dblp:conf/dac/Seshia12 fatcat:otziclzmebemdcllerhtwbknsi

Sciduction: Combining Induction, Deduction, and Structure for Verification and Synthesis [article]

Sanjit A. Seshia
2012 arXiv   pre-print
Structure hypotheses are used to define the class of artifacts, such as invariants or program fragments, generated during verification or synthesis.  ...  Inductive inference, which generalizes from specific instances to yield a concept, includes algorithmic learning from examples.  ...  "We propose a method of constructing concurrent programs in which the synchronization skeleton of the program is automatically synthesized from a high-level (branching time) Temporal Logic specification  ... 
arXiv:1201.0979v1 fatcat:ij726hwu3faytg3knqrmp5trjq

Page 18 of Language Sciences Vol. , Issue 14 [page]

1971 Language Sciences  
To summarize: I have been con- cerned with setting forth a speech production model that might form the basis of a control program for speech synthesis-by-rule.  ...  The model differs from existing synthesis models in that its input has undergone phonological transformations from the phonemic level.  ... 

Cancer treatment planning: Formal methods to the rescue

Janos Mathe, Janos Sztipanovits, Mia Levy, Ethan K. Jackson, Wolfram Schulte
2012 2012 4th International Workshop on Software Engineering in Health Care (SEHC)  
Patient specific treatment plans are generated from protocol models using patient models, resource models and execution constraints.  ...  FORMULA specifications are based on algebraic data types and open-world logic programs.  ... 
doi:10.1109/sehc.2012.6227014 dblp:conf/icse/MatheSLJS12 fatcat:qrfb23xipjckvfixk2z5t26k5a

Program Synthesis for Multi-agent Question Answering [chapter]

Richard Waldinger, Peter Jarvis, Jennifer Dungan
2003 Lecture Notes in Computer Science  
We illustrate the use of program synthesis techniques in a system that answers questions about geography.  ...  Techniques that were developed for program synthesis are being applied to allow multiple agents to communicate with each other and cooperate to solve a single problem.  ...  Relation to Other Work There is a large body of work, not surveyed here, in using theorem proving to answer questions or to synthesize programs from specifications.  ... 
doi:10.1007/978-3-540-39910-0_32 fatcat:cjhcyv46zzctfavf53iddnbzuy
« Previous Showing results 1 — 15 out of 30,349 results