Filters








14 Hits in 10.0 sec

Automation of Mathematical Induction as part of the History of Logic [article]

J Strother Moore, Claus-Peter Wirth
2014 arXiv   pre-print
He developed a marking concept for the tagging of rewrite lemmas (cf. § 6.3.1), where the elements of a clause can be marked as Forbidden, Mandatory, Obligatory, and Generous, to control the recursive  ...  Simplification with lemmas tagged for rewriting and the heuristics behind the process are nicely described in [ Schmidt-Samoa, 2006c ] , where a rewrite lemma is not just tagged for rewriting, but where  ... 
arXiv:1309.6226v5 fatcat:i7nzngq47zfd7its4kfynlfpti

The Algorithm of Islamic Jurisprudence (Fiqh) with Validation of an Entscheidungsproblem [article]

Elnaserledinellah Mahmood Abdelwahab, Karim Daghbouche, Nadra Ahmad Shannan
2016 arXiv   pre-print
As a foundation, ageneric algorithm for deciding Fiqh-rulings is designed to enable and further leverage rule of law (vs. rule by law) with full transparency and complete algorithmic coverage of Islamic  ...  law eventually providing legal security, legal equality, and full legal accountability.This is implemented by disentangling and reinstating classic Fiqh-methodology (usul al-Fiqh) with the expressive  ...  The process of deducing negative and positive rules is an efficient practical (heuristic) alternative to classical deduction of general formulas 47 The constructed trees for taymammum (as per Shafi'i)  ... 
arXiv:1604.00266v1 fatcat:y5ydvmlm7nh55hplpu4f63jaza

Multi-word Entity Classification in a Highly Multilingual Environment

Sophie Chesney, Guillaume Jacquet, Ralf Steinberger, Jakub Piskorski
2017 Proceedings of the 13th Workshop on Multiword Expressions (MWE 2017)  
We also want to thank the IC1207 COST Action PARSEME and SIGLEX for their endorsement and support, as well as the EACL 2017 organizers.  ...  , and all involved participants for their interest in the workshop.  ...  We thank the annotators for their work and the anonymous reviewers for their insightful comments. We thank Nikola Ljubešić for his help with the hrMWELex lexicon.  ... 
doi:10.18653/v1/w17-1702 dblp:conf/mwe/ChesneyJSP17 fatcat:bv7aavgth5eurmzuphuowtuuhq

Physical Principles and Visual-OMP Software for Optimal PCR Design [chapter]

John SantaLucia
2007 Msphere  
This can be accomplished by generalizing the approach described above for the two-state case (see Eqs. 5-11). Fig. 3 .  ...  For example, a G − G mismatch contributes as much as −2 2 kcal/mol to duplex stability at 37 C, whereas a C − C mismatch can destabilize a duplex by as much as +2 5 kcal/mol.  ...  The authors thank Katre Palm for a valuable help with English grammar.  ... 
doi:10.1007/978-1-59745-528-2_1 pmid:17951788 fatcat:tghqvlsslzcspmi673q4m4q32m

Competition and Regulation

Harold S. Luft
1985 Medical Care  
It is generated by the flexible, second-order Taylor series local expansion of the general-form neoclassical cost function.  ...  Thus price regulation by member states is neither forbidden nor explicitly hindered by the EU.  ...  Among the inputs we provide an estimate for the generating capacities available and the cost of generation, demand as well as the transmission network data.  ... 
doi:10.1097/00005650-198505000-00005 fatcat:tdsu5ojwwrenfj7t6p3fjfx46i

Syntactic liars

B. H. Slater
2002 Analysis  
Natural language does allow consistent semantic closure, once we investigate indirect speech further, and so see that there can be no general 1-1 correspondence between speech and meaning.  ...  The difficulty with syntactic liars is that there would seem to be very good reason to identify the thing said which is true with the thing said which is false.  ...  and the fulfilment of the conditions prescribed by the law for the time being in force for the authentic expression of the supreme will.  ... 
doi:10.1093/analys/62.2.107 fatcat:z5twgpkjrzblfpt5rik3k5wkou

Syntactic liars

B. H. Slater
2002 Analysis  
Natural language does allow consistent semantic closure, once we investigate indirect speech further, and so see that there can be no general 1-1 correspondence between speech and meaning.  ...  The difficulty with syntactic liars is that there would seem to be very good reason to identify the thing said which is true with the thing said which is false.  ...  and the fulfilment of the conditions prescribed by the law for the time being in force for the authentic expression of the supreme will.  ... 
doi:10.1111/1467-8284.00340 fatcat:ab75hjic6nec5ljootyaxt7t24

Abstract Execution: Automatically Proving Infinitely Many Programs

Dominic Steinhöfel
2020
Our logic for Abstract Execution uses abstract state changes to represent unknown effects on local variables and the heap, and models abrupt completion by symbolic branching.  ...  , Correctness-by-Construction, and more.  ...  To facilitate reasoning about problems expressed in MTL, we translate them to regular symbolic traces and use Symbolic Trace Logic, a logic for reasoning about inclusion of trace sets represented by symbolic  ... 
doi:10.25534/tuprints-00008540 fatcat:l7fwhogwufga5fjub4wnq74i2q

Dynamic Logic for an Intermediate Language: Verification, Interaction and Refinement

Mattias Ulbrich
2013
This thesis is about ensuring that software behaves as it is supposed to behave.  ...  More precisely, it is concerned with the deductive verification of the compliance of software implementations with their formal specification.  ...  These lemmas allow us to finally formulate the completeness theorem for UDL. Defining formulas for modalities are discharged using Lemma 3.17, and Lemma 3.18 is used to remove them from the sequent.  ... 
doi:10.5445/ir/1000041169 fatcat:wbftvipsyffrtlpck4cfwqdp54

Towards a Methodology for Business Process Revision Under Norm and Outcome Compliance

Simone Scannapieco, University, My, Abdul Sattar, Guido Governatori
2018
When the enterprise is seen as an entity embedded in an environment regulated by norms, the concept of norm compliance comes into play.  ...  How to revise business processes and adjust their behaviour with respect to these changes?  ...  Conditions (1) and (2.2) of Definitions 9 and 11 are vacuously satisfied with the same comment for R B,X BPL in Lemma 52. Lemma 55.  ... 
doi:10.25904/1912/686 fatcat:jz6lbukjvbgfrpq7nj6jl4lcwe

Proceedings of the Eighth International Workshop on Treebanks and Linguistic Theories

Marco Passarotti, Adam Przepiórkowski, Savina Raynaud, Frank Van Eynde
2012 Largo Gemelli   unpublished
This one-day event, preceding TLT8, was devoted to the FrameNet project and conceived as a masterclass and talk by Charles J.  ...  Fillmore (in the morning) followed in the afternoon by a workshop with seven oral presentations (peer-reviewed) on research concerning FrameNet and related linguistic and corpus topics.  ...  We are grateful to Josef Toman for significant help with the implementation of our extension to TrEd and to Miroslav Týnovský for preliminary merging of PCEDT and PDT files into the TMT format.  ... 
fatcat:te25pznnxvcs7jqceeqcyoxcse

Specification, Execution and Verification of Interaction Protocols An Approach based on Computational Logic Settore Disciplinare: ING-INF05 Ciclo XIX Examing Committee

Chiar Ma, Paola Mello, School, Federico Chesani, Chiar Mo, Bassi, Paola Mello, School, Paolo Bassi, Anna Ciampolini, Letizia, Cesare Stefanelli
unpublished
Moreover, with the increasing complexity of modern distributed systems, protocols are used also to control such a complexity, and to ensure that the system as a whole evolves with certain features.  ...  Moreover, by suitably adapting the SCIFF Framework, we propose solutions for addressing (1) the protocol properties verification (g-SCIFF Framework), and (2) the a-priori conformance verification of peers  ...  This condition is expressed by placing a question mark in the results tables, instead of a value.  ... 
fatcat:sosm2oz3wjdlli5n6g754aed24

Measuring coselectional constraint in learner corpora: A graph-based approach

Anna Valer'evna Shadrova, Humboldt-Universität Zu Berlin
2020
The graph metric is computed for a range of subcorpora chosen by various criteria. Extensive internal validation is performed through a number of sampling techniques.  ...  is proposed as an alternative.  ...  Also, German as a language with a somewhat flexible word order is generally less accurately captured in surface adjacency models.  ... 
doi:10.18452/21606 fatcat:ymw6xanpsbc3bccu443kkusp5m

Spécialité : Informatique Survivability in Multilayer Networks: Models and Polyhedra

S Th, Mccormick
unpublished
This means that only one path By lemma 7.3, to have a feasible solution for the MSOND problem, one must use both leaving points and only one reaching point.  ...  First, for the SC-MSOND problem, not all the nodes must be visited, only terminals are mandatory.  ...  As t i , s and s ′ are all arbitrary, we have for all t i ∈ T k , s, s ′ ∈ S k , t i s ′ / ∈ δ(Π), and t i s, ss ′ ∈ δ(Π) \ F, for some λ k 1 (t i ) ∈ R, ρ ∈ R. (4.108) Now, let ρ ∈ R be as given by (4.103  ... 
fatcat:3r6cod4rnbfhhoatpejziayaqm