bluuebunny/crossref_metadata_2025 huggingface dataset:
Kommunikatív konfliktusmegoldás. Problémamegoldók-e a mediáció résztvevői?
Authors: FERENCZI Andrea
Published: January 2018

Communicative conflict-solving
The essential promise of the mediation is that it can help to avoid on both sides the dead-end defined in the research results of the Harward Negotiation Project, which reduces the chance of an agreement. Mediation creates a possibility for the parties to overcome on one side the attitude, which struggles to subordinate the strengths of the other side. This occurs, when any of the parties emphasizes only his own interpretation about the situation, or offers only his own solution proposals, without any kind of self-reflection or the curiosity towards the arguments of the other party. This attitude is labeled: “the parties are enemies”. On the other side, mediation overcomes the attitude, which would seek at any price a modus vivendi, through compromises, which lead to abandoning the own principles. This attitude is labeled: “the parties are friends”. Mediation also helps finding a new ability of the parties meant to coexistence to provide common efforts. This attitude is labeled: “the parties want to solve problems”. The last possibility among the mutual satisfaction may ground for long term the effective cooperation and success of the parties. On this level it may lead to communicative action.
In this study I analyze the narratives and thematization of the mediation in the local literature from the point of view of finding an answer to the question: to what account does the process of mediation make possible the realization of the communicative action (Ferenczi, 2010).
Effects of two fractions of inspired oxygen during anesthesia on early postanesthesia oxygenation in healthy dogs
Authors: Martin-Flores Manuel , Tseng Chia T. , Robillard Steven D. , Abrams Brittany E. , Campoy Luis , Harvey H. Jay , Gleed Robin D.
Published: January 2018

OBJECTIVE To evaluate the effects of 2 fractions of inspired oxygen (Fio2s) during anesthesia on postanesthesia Pao2 and other measures of oxygen exchange.

ANIMALS 22 healthy adult sexually intact female dogs undergoing ovariohysterectomy by ventral midline celiotomy.

PROCEDURES Dogs were randomly assigned to receive either oxygen (Fio2 > 0.9 [100% oxygen]; n = 11; control group) or a mixture of nitrogen and oxygen (Fio2 = 0.4; 11; 40% oxygen group) as the carrier gas for isoflurane while anesthetized. All dogs were allowed to breathe spontaneously while anesthetized. For each dog, the Pao2, Paco2, other indices of oxygenation, and extent of sedation were monitored at predetermined times during and for 1 hour after anesthesia. Measured variables were compared between the 2 treatment groups and over time within each treatment group.

RESULTS None of the measured variables differed significantly between the control and 40% oxygen groups at any time during the postanesthesia period. Within each treatment group, the Paco2 and extent of sedation decreased over time during the postanesthesia period.

CONCLUSIONS AND CLINICAL RELEVANCE Results indicated that indices of oxygenation did not differ significantly between healthy dogs in which the Fio2 was maintained at > 0.9 and those in which the Fio2 was maintained at 0.4 while anesthetized for ovariohysterectomy. Thus, the addition of nitrogen to the carrier gas for an inhalant anesthetic conferred neither an advantage nor disadvantage in regard to oxygenation during the first hour of anesthesia recovery.
Genome-wide sequencing and quantification of circulating microRNAs for dogs with congestive heart failure secondary to myxomatous mitral valve degeneration
Authors: Jung SeungWoo , Bohan Amy
Published: January 2018

OBJECTIVE To characterize expression profiles of circulating microRNAs via genome-wide sequencing for dogs with congestive heart failure (CHF) secondary to myxomatous mitral valve degeneration (MMVD).

ANIMALS 9 healthy client-owned dogs and 8 age-matched client-owned dogs with CHF secondary to MMVD.

PROCEDURES Blood samples were collected before administering cardiac medications for the management of CHF. Isolated microRNAs from plasma were classified into microRNA libraries and subjected to next-generation sequencing (NGS) for genome-wide sequencing analysis and quantification of circulating microRNAs. Quantitative reverse transcription PCR (qRT-PCR) assays were used to validate expression profiles of differentially expressed circulating microRNAs identified from NGS analysis of dogs with CHF.

RESULTS 326 microRNAs were identified with NGS analysis. Hierarchical analysis revealed distinct expression patterns of circulating microRNAs between healthy dogs and dogs with CHF. Results of qRT-PCR assays confirmed upregulation of 4 microRNAs (miR-133, miR-1, miR-let-7e, and miR-125) and downregulation of 4 selected microRNAs (miR-30c, miR-128, miR-142, and miR-423). Results of qRT-PCR assays were highly correlated with NGS data and supported the specificity of circulating microRNA expression profiles in dogs with CHF secondary to MMVD.

CONCLUSIONS AND CLINICAL RELEVANCE These results suggested that circulating microRNA expression patterns were unique and could serve as molecular biomarkers of CHF in dogs with MMVD.
Biomechanical evaluation of modified laryngoplasty by use of a toggle technique for stabilization of arytenoid cartilage in specimens obtained from equine cadavers
Authors: Secor Erica J. , Gutierrez-Nibeyro Santiago D. , Horn Gavin P.
Published: January 2018

OBJECTIVE To biomechanically compare modified and standard laryngoplasty constructs in monotonic load to failure and cyclic loading.

SAMPLES 41 equine cadaveric larynges.

PROCEDURES Laryngoplasty constructs were created by use of a standard technique on one side and a modified technique (with a toggle to anchor suture to the arytenoid cartilage) on the other side. For monotonic loading, laryngoplasty constructs were prepared and suture ends attached to a load frame; constructs then were loaded until mechanical failure. Mean load at failure and failure modes were compared between constructs. For cyclic loading, arytenoid cartilages were maximally abducted and constructs were circumferentially loaded for 10,000 cycles. Loss of arytenoid abduction was evaluated every 500 cycles with a subjective grading scale and objective change in rima glottidis cross-sectional area.

RESULTS In monotonic loading, modified laryngoplasty constructs failed at a significantly higher mean ± SD load (191 ± 29 N) than did standard laryngoplasty constructs (91 ± 44 N). None of the modified laryngoplasty constructs failed by suture pull-through of the muscular process of the arytenoid cartilage, whereas most of the standard laryngoplasty constructs failed in that manner. In cyclic testing, 11 of 20 standard laryngoplasty constructs failed or achieved Dixon grade 3 abduction, whereas 0 of 20 modified laryngoplasty constructs failed. Modified laryngoplasty constructs lost significantly less rima glottidis cross-sectional area in circumferential testing, compared with loss for standard laryngoplasty constructs.

CONCLUSIONS AND CLINICAL RELEVANCE The modified laryngoplasty technique was biomechanically superior to the standard laryngoplasty technique in this ex vivo study.
Effect of metoclopramide treatment of bitches during the first week of lactation on serum prolactin concentration, milk composition, and milk yield and on weight gain of their puppies
Authors: Keller Stefanie R. , Abonyi-Tóth Zsolt , Sprenger Norbert , Austin Sean C. , Wichert Brigitta A. C. , Liesegang Annette , Oei Christine H. Y. , Balogh Orsolya , Reichler Iris M.
Published: January 2018

OBJECTIVE To investigate effects of metoclopramide orally administered to healthy bitches on serum prolactin and milk lactose concentrations, gross energy, and dry matter content and on puppy weight gain during early lactation.

ANIMALS 20 client-owned bitches and their 121 puppies.

PROCEDURES 10 bitches received metoclopramide (0.2 mg/kg, PO, q 6 h for 6 days; treatment group) starting 10 to 24 hours after birth of the last puppy of the litter (day 0), and 10 bitches served as the control group. Blood and milk samples from all bitches were collected on days 0, 1, 2, 4, and 6. Milk samples for days 1 and 2 and days 4 and 6 were pooled because of small volume. Puppies were weighed twice daily.

RESULTS Serum prolactin concentration increased significantly over time in both groups, and no treatment effect was detected. When day-to-day changes were analyzed, the prolactin concentration increased from day 0 to day 1 in the treatment group but not in the control group. Milk lactose concentration increased significantly and was higher in the treatment group than in the control group. Milk dry matter content was unchanged, whereas the time course for milk gross energy content differed significantly between treatment and control bitches. Puppy weight gain was not affected by metoclopramide treatment.

CONCLUSIONS AND CLINICAL RELEVANCE Oral administration of metoclopramide to healthy bitches after parturition induced a transient increase in serum prolactin concentration and stimulated milk lactose production. It is likely bitches with insufficient or delayed milk production could benefit from metoclopramide treatment.
Delayed Credit Recovery in Croatia: Supply or Demand Driven?
Authors: Dumičić Mirna , Ljubaj Igor
Published: January 2018

In order to enhance the understanding of credit cycle dynamics in Croatia, we explore the evolution of credit demand and credit supply of corporates and households in Croatia and identify their determinants based on the switching regression framework. These results are crosschecked by the insights from the bank lending survey. The conducted analysis shows there are both supply and demand-side factors that limit the possibility of intensifying household and corporate credit activity. However, a more pronounced drag seems to be coming from subdued demand, which is greatly influenced by the unfavourable domestic macroeconomic environment and, particularly, GDP developments. This suggests that it is not unusual that credit recovery is still missing but also confirms that the scope for monetary policy to stimulate lending is limited.
Language Kinship between Tulambatu and Tolaki Language in North Konawe
Authors:   Hanna,   Mursidin, Jannah Siti Nur Rochmatul
Published: January 2018

This study was intended to explore the genetic relationship between Tulambatu and Tolaki languages as members of Austronesian family language, particularly those included in the branch of Malay Polynesian sub-group. They have identical and similar lexis, phonetics, as well as corresponding phonemic and different phonemes. The aims of this study were: (1) to describe the level of genetic relationship between Tulambatu and Tolakinese languages in North Konawe regency, (2) to determine the period when the two languages were separated in terms of the basic vocabulary, (3) to predict the age of Tulambatu and Tolakinese languages in North Konawe regency. Data of the study were 200 vocabulary of Tulambatu and Tolakinese languages based on Swadesh lists that have been translated by native speakers of the two languages. The study was a historical comparative linguistics research and used the Lexicostatistics technique to find evidences that explain the genetic relationship of the languages. Based on the Lexicostatistics technique, it was found that the percentage of the vocabulary relationship of Tulambatu and Tolakinese languages was 52.02%. This proved that both languages are members of a sub-family of genetically similar languages (Astronesian Malayo Polinesian). In addition, it is believed that Tulambatu and Tolakinese languages were a single language 1636-1378 years ago, and they began to separate from their mother language around 379-637 AD (as of 2015).
Domestic and Social Violence against Women during the Egyptian Uprising
Authors: Wasef Nevine Henry
Published: January 2018

This study discusses how social and domestic violence against women increased during the period of political violence represented by the Egyptian Uprising of the 25thof January 2011. In this paper, the term political violence had been defined as any use of force practiced by governmental or anti-governmental groups to achieve political goals. Many scholars use the terms political violence and political instability interchangeably while the latter refers to a situation when a government had been toppled which was found to be strongly affiliated with political violence. Political violence includes uprisings and political transition of authority. Social violence is associated with sexual harassment, social norms and gender roles. Domestic violence refers to any physical harm among family members against women and domestic practices like early marriage and female circumcision. The article discusses first how the three types of violence interact and affect one another. The study in turn researches the increase of domestic violence rate against women in reaction to the political conflict resulting from the Egyptian Uprising of January 25th, 2011 through conducting interviews with abused women to investigate how the Egyptian Uprising had affected them socially and domestically. The study concludes that political violence had a direct impact on social and domestic violence against women.
Minimization of Delay Costs in the Realization of Production Orders in Two-Machine System
Authors: Dylewski Robert , Jardzioch Andrzej , Dworak Oliver
Published: January 2018

The article presents a new algorithm that enables the allocation of the optimal scheduling of the production orders in the two-machine system based on the minimum cost of order delays. The formulated algorithm uses the method of branch and bounds and it is a particular generalisation of the algorithm enabling for the determination of the sequence of the production orders with the minimal sum of the delays. In order to illustrate the proposed algorithm in the best way, the article contains examples accompanied by the graphical trees of solutions. The research analysing the utility of the said algorithm was conducted. The achieved results proved the usefulness of the proposed algorithm when applied to scheduling of orders. The formulated algorithm was implemented in the Matlab programme. In addition, the studies for different sets of production orders were conducted.
Comparative efficacy of herbal anti-diarrheal products for treatment of diarrhea in calves
Authors: Ranaut Nishant Deep Singh , Sharma Pranshu , Ravikanth Kotagiri , Ganguly Bhaskar
Published: January 2018

Objective: The present study was undertaken to compare the efficacy of herbal drugs, Diaroak® and Salcochek® (M/s Ayurvet Limited), against antibiotic drugs in the treatment of calf diarrhea.Methods: 15 calves suffering from diarrhea were divided into 3 groups: T0,receiving ciprofloxacin (250 mg) and tinidazole (300 mg) twice daily for three days, T1, receiving 15 gm Diaroak twice daily till recovery, and T3, receiving 15 gm Salcochektwice daily till recovery. The parameters evaluated included average number of doses required for complete recovery, total number of animals completely recovered per group, number of animals in morbid state per group, mortality recorded per group, frequency of defecation per group, presence or absence of mucus in feces along with appetite of animals, and incidence of diarrhea and mortality during post-treatment period.Results: Complete recovery was seen in all the treated animals with no recurrence. After recovery, animals treated with herbals had better consistency of feces than those treated with antibiotics.Conclusions: Herbal anti-diarrheals Diaroak and Salcocheck can be used for treating non-specific diarrhea in calves.
中国河北省旅游产业发展潜力的空间差异研究
Authors: 王 军 , 冯 运双 , 魏 飒
Published: January 2018

论文概括了旅游产业发展潜力的内涵，确定了旅游产业发展潜力评价指标体 系包含自我成长潜力和外部支撑潜力，并运用多因素综合分析法对中国河北省 11 个市 的旅游产业发展潜力进行了分析。研究表明，河北省区域旅游产业发展潜力呈增长态 势，并在空间上表现为东部较强、中部和东北部次之、西部较弱的非均衡格局，多数城市 旅游产业依然存在发展潜力。
行政事业单位财务管理中会计集中核算的应用研究
Authors: 文 玉兰
Published: January 2018

随着国家财务深化改革的推行与实施，会计集中核算制度被广泛应用在行政事业单位的财务管理中，并为行政单位的财务发展做出较大贡献。作为财务管理的重要组成部分，会计集中核算制度不仅关系着行政单位的财务发展，并且对国家的财政规划也具有重要影响。基于此，论文阐述了集中核算制度的重要性，并对其在行政事业单位应用中产生的问题提出相应的解决办法。
KEMAMPUAN GURU MI YANG BERSERTIFIKAT PENDIDIK DALAM MENYUSUN RENCANA PEMBELAJARAN (Kasus Kota Pekalongan)
Authors: Suraji Imam , Wamugi * , Nurkhamidi Aris
Published: January 2018

This study aimed to investigate the capability of certified teachers of Islamic elementary school located in Pekalongan City in preparing lesson plan. Fourteen informants -- consist of 6 government teachers and 8 non-government teachers -- were investigated. The data were taken from the lesson plan documents prepared by them and then followed up with an interview. The results showed that: (1) there are many teachers who have not been able to develop their own learning devices, and (2) there are still very much in error that occurred in the lesson plan prepared by them. There are several constraints faced by them. They are: (1) their knowledge is still lack, their innovation and creativity were not maximized; (2) the pattern of development for them had not touched their academic aspect; (3) the orientation of the supervisions which only leaded to the administrative aspects; and (4) their independence lack in preparing learning device, which is part of the curriculum.
PENDIDIKAN KARAKTER MELALUI PEMBELAJARAN MATEMATIKA
Authors: * Salafudin
Published: January 2018

This study aimed to determine: (1) how was the design of character building by learning mathematics, and (2) whether the character building by learning mathematics could produce better learning outcome of mathematics than conventional mathematics learning.To answer these two questions, I used Research and Development ( R & D ) which consists of a preliminary study to obtain preliminary data on student learning outcomes before being given treatments of character building by learning mathematics. The next phase is the design of the character building by learning mathematics. Further testing and revision in class and repeated until it found the best learning model. From the first problem formulation, qualitative data analysis, such as the design of character building in learning mathematics was produced. The results of the qualitative analysis shows, character building by learning mathematics was quite effectively applied to implant positive character in students. To answer the second question, statistical analysis was used. The population in this study was all students of class VII of MTsN in Buaran of Pekalongan which totaled 220. By random cluster sampling technique two classes (a class VII A and VII B) was chosen. Class VII A was as an experiment class, and class VII B was as a control class. Data were taken by the test method, experimental classroom observation, and documentation. The data was then processed with an average difference test. Results of statistical analysis obtained t = 3.33 > t table = 1.67. This meant that learning achievement of the students in the experimental class, which was implemented character education in mathematics was better than the students who were taught by conventional methods. Based on these results, it could be conclude that the character building in mathematics was better than the conventional method of learning mathematics.
OPTIMIZING LISTENING SKILLS TO IMPROVE THE TOEFL SCORE OF STAIN PEKALONGAN STUDENTS
Authors: . Riskiana
Published: January 2018

The fact that the students have problems in the three micro-skills of listening namely recognizing the English stress patterns, the reduced forms of words, and words boundaries and that the teachers never teach the students how to listen have made them get low TOEFL scores on listening section. This research aims at: (1) finding out whether optimizing listening skills can improve the students’ TOEFL scores on listening; and (2) describing the class situation during the teaching of toefl listening by optimizing listening skills. This action research is conducted in two cycles each of which is divided into planning, acting, observing, and reflecting. There are two kinds of data. The qualitative data taken from observation, interview, and questionnaire are analyzed by using Constant Comparative Method. The quantitative data taken from the pre-test in the pre-research, post-test in cycle 1, and post-test in cycle 2 are analyzed by using descriptive statistics. The subjects of the research are the STAIN Pekalongan students taking English 3 class, the TOEFL Preparation Class, in the Academic Year 2014/2015. The result of the research shows that: (1) teaching toefl listening section by optimizing listening skills is able to overcome the students’ problems in the three micro-skills of listening and consequently improve the students’ TOEFL scores on listening. Their average scores improve from 101 in the pre-test to 118 in the post-test of cycle 1 and 129 in the post-test of cycle 2; (2) The class situation is attractive and the students are actively involved in the various activities done during the teaching and learning process. In line with the success of optimizing listening skills in teaching TOEFL listening, it is suggested that teachers should examine their students’ listening problems so as to be able to teach them what they need in listening to English.
SELUBUNG HISTORIOGRAFI SYEKH MAULANA MAGHRIBI WONOBODRO
Authors: Fauzan Muchamad
Published: January 2018

This study aimed to reveal the understanding and perceptions of the public upon history of Sheikh Maulana Maghribi’s (SMM) tomb and character. This qualitative approach used historical research. The results showed that the SMM’s history of the tomb and his figures are still remembered and understood among Wonobodro community through two ways, namely: through word of mouth from family members or other people hereditary and through oral explanation from the manager of the tomb complex, especially Interpreter Lock to pilgrims. In addition, it was also revealed that there are two different informants understanding about the real identity of Sheikh Maulana Maghribi. It is caused by lack of depth information obtained by Wonobodro community. The conclusion that there is character and story elements that reflect the similarities of culture, values and experience of informants and community.
GERAKAN SOSIAL PETANI DESA BANJARANYAR DALAM MEMPERJUANGKAN LAHAN PERTANIAN
Authors: Susanto Nanang Hasan
Published: January 2018

This study was aimed to determine the history of social movements of Banjaranyar farmers, examined political economy theories of Popkin (1979) in The Rational Peasant: The Politics Economy of Rural Society in Vietnam that the resistance movement of farmers occurred when most people feel disadvantaged, and examined the theory of Scott (1976)about the concept of leadership and social structure. Through a historical approach, with the observation method of participation (participant observation) on the field, the study concluded, that the history of the struggle of Banjaranyar Farmers had a genuine dynamic, and the political economy theory of Popkin (1979), the theory of Scot (1976) manifested in social history that took place in the village of Banjaranyar.
EFEKTIVITAS ILMU NAHW DALAM PEMBELAJARAN BAHASA ARAB: Studi Kasus di Mas Simbang Kulon Pekalongan
Authors: Mu'in Abd. , Mustakim Zaenal , Maulida Chusna , Burhan Ali
Published: January 2018

قـد تـعـلق تعـلم الـنحوبـتـعـلم اللـغـة الـعـربـية تـعـلقا قـويـا. اذا تـعلم شـخـص اللـغـة الـعـربيـة للـتـحـدث , فلـيـس بـواجـب أن يـهـتم النـحو اهـتـمـا ما كامـلا. الا اذا تـعـلم اللـغة الـعـربـية الـفـصـحـة الـصحـيـحـة فلا بـد أن يـتـعلـمـه تـعـلـما صـحـيـحا. لـذالك يـعـرف أن تـعـلم اللـغة الـعـربـية في المـدرسـة الـعـالـية الـسـلا فـية بسـيـمـبـانـج كـولـون يـهـتم ذلك كـله, حـتي يـرى ان تلامـيـذهـا يـسـتـطيـعـون أن يـقرأوا ويـتـرجـموا ويـسـتـمـعوا الـكلا م الـعـربي جـيـدا. اعـتـمـادا عـلي هـذا الـمـوقـع يـلا خـص أن عـلم الـنـحـومـفـيـد جـدا في اعـانـة تـعـلم اللـغـة الـعـربـية بـسـيـمـبانـج كـولـون. عـلـمـا أن نـتائـج اللـغـة الـعـربـية لأ كـثـر تـلا مـيذهـا أعـلي قـيـمـة (يـعـني بـين 78 – 80 ) عـلي حـسـب تـقـديـر الـقـيـمـة مـن الـمـدرسـة الـعالـية الـسلافـية بـسـبـانـج كـولـون فـكالـونـجـان (يـعـني بـين 70 – 76 ). هذا يدل على أن تقدير القيمة التلاميذ فيها جيدا أو جيدا جدا.
Factor de la reflectancia bi-cónica en especies vegetales contrastantes: modelación global
Authors: Paz Pellat Fernando , Cano Alejandro , Bolaños Martín , Chávez José , Marin Ma. Isabel , Romero Enrique
Published: January 2018

Classification of vegetation using multi-angular spectral information has been approximated using restricted modeling schemes or with homogeneity or stationarity hypotheses. This paper presents a global modeling scheme of zenith and azimuthal angles in vegetation reflectance, extending the developments to the case of effects of changes on optical properties of vegetation substrates (soils) and plant density (foliage). This synthesis is performed in an upper space of compaction that depends essentially on two parameters and encompasses all the variations analyzed. The global modeling scheme developed was applied to the case of plant arrangements, different densities, of eight species with contrasting archetypes and bare soils. Modeling was applied to measurements of bi-conical reflectance factors, where adjustments were excellent (generally with R2 ≥ 0.99 and mean relative errors less than 7%). Analysis of the results showed that multi-angular spectral information for species classification under generalized conditions still has problems in discriminating species. This can be explained by the analysis synthesis of variations associated with discrimination.
Verification of Imperative Programs through Transformation of Constraint Logic Programs
Authors: De Angelis Emanuele , Fioravanti Fabio , Pettorossi Alberto , Proietti Maurizio
Published: January 2018

We present a method for verifying partial correctness properties of imperative programs by using techniques based on the transformation of constraint logic programs (CLP). We consider: (i) imperative programs that manipulate integers and arrays, and (ii) first order logic properties that define configurations of program executions. We use CLP as a metalanguage for representing imperative programs, their executions, and their properties. First, we encode the correctness of an imperative program, say Prog, as the negation of a predicate 'incorrect' defined by a CLP program T. By construction, 'incorrect' holds in the least model of T if and only if the execution of Prog from an initial configuration eventually halts in an error configuration. Then, we apply to program T a sequence of transformations that preserve its least model semantics. These transformations are based on well-known transformation rules, such as unfolding and folding, guided by suitable transformation strategies, such as specialization and generalization. The objective of the transformations is to derive a new CLP program TransfT where the predicate 'incorrect' is defined either by (i) the fact `incorrect.' (and in this case Prog is incorrect), or by (ii) the empty set of clauses (and in this case Prog is correct). In the case where we derive a CLP program such that neither (i) nor (ii) holds, we iterate the transformation. Since the problem is undecidable, this process may not terminate. We show through examples that our method can be applied in a rather systematic way, and is amenable to automation by transferring to the field of program verification many techniques developed in the field of program transformation.
Lexical Semantics with Linear Types
Authors: Mery Bruno
Published: January 2018

We have proposed a framework based upon the λ -calculus with higher-order intuitionistic types for the symbolic computation of the semantic analysis, integrating lexical data. This proposal is sufficient for many phenomena and accurately incorporates lexical semantics by the means of type theory, but some issues linger in the linguistic data. In the present paper, we revisit this proposal with a version of the λ -calculus based upon higher-order linear types, that aims to resolve those issues and present an integrated framework for meaning assembly.
Improved Heuristic for Manipulation of Second-order Copeland Elections
Authors: Lasisi Ramoni , Lasisi Abibat
Published: January 2018

The \textit{second-order Copeland} voting scheme is NP-complete to manipulate even if a manipulator has perfect information about the preferences of other voters in an election.~A recent work proposes a \textit{branch-and-bound} heuristic for manipulation of second-order Copeland elections.~The work shows that there are instances of the elections that may be manipulated using the branch-and-bound heuristic.~However, the performance of the heuristic degraded for fairly large number of candidates in elections.~We show that this heuristic is \textit{exponential} in the number of candidates in an election, and propose an improved heuristic that extends this previous work.~Our improved heuristic is based on \textit{randomization technique} and is shown to be \textit{polynomial} in the number of candidates in an election.~We also account for the number of samples required for a given accuracy and the probability of missing the accurate value of the number of manipulations in an election.
The Challenges of Evaluating a New Feature in Vampire
Authors: Reger Giles , Suda Martin , Voronkov Andrei
Published: January 2018

This paper presents and explores experimental results examining the usage of AVATAR (Advanced Vampire Architecture for Theories and Resolution). This architecture introduces a new method for splitting in first-order resolution and superposition theorem provers that makes use of a SAT (or SMT) solver to make splitting decisions. The architecture (as implemented in Vampire) has many options and components that can be varied and this paper explores the effects of these variations on the performance of the prover.
Matching Qualitative Constraint Networks with Online Reinforcement Learning
Authors: Chipofya Malumbo
Published: January 2018

Local Compatibility Matrices (LCMs) are mechanisms for computing heuristics for graph matching that are particularly suited for matching qualitative constraint networks enabling the transfer of qualitative spatial knowledge between qualitative reasoning systems or agents. A system of LCMs can be used during matching to compute a pre-move evaluation, which acts as a prior optimistic estimate of the value of matching a pair of nodes, and a post-move evaluation which adjusts the prior estimate in the direction of the true value upon completing the move. We present a metaheuristic method that uses reinforcement learning to improve the prior estimates based on the posterior evaluation. The learned values implicitly identify unprofitable regions of the search space. We also present data structures that allow a more compact implementation, limiting the space and time complexity of our algorithm.
Multiple Agent Based Entailment System(MABES) for RTE
Authors: Jung Byungtaek , Soh Chiseung , Hong Kihyun , Lim Seungtak , Rhim Young-Yik
Published: January 2018

Despite growing needs of the legal artificial intelligence (AI), its development is slower than other AI domains because legal expertise is essentially required to develop legal AI systems. Legal knowledge representation on legal expertise needs to be considered to implement legal reasoning AI systems. In this paper, we present a legal reasoning methodology, which utilizes multiple expert knowledge based agents. These agents are designed to solve recognizing textual entailment (RTE) problems with syntactic and interpretative knowledge. The validity of the proposed method is provided through experiments with the COLIEE 2017 data.
Gödel logics with an operator shifting truth values
Authors: Baaz Matthias , Fasching Oliver
Published: January 2018

We consider Gödel logics extended by an operator whose semantics is given by I(oA)=min{1,r+I(A)}.
Verification of Multi-Party Ping-Pong Protocols via Program Transformation
Authors: Nepeivoda Antonina
Published: January 2018

The paper describes a verification technique based on program transformation with unfolding that allows to find short attacks on multi-party ping-pong protocols in the Dolev-Yao intruder model. Protocols are modelled by prefix grammars, and questions of model optimization and complexity are considered.
Towards an Information-Theoretic Approach to Population Structure
Authors: Tal Omri
Published: January 2018

This paper uses an information-theoretic perspective to propose multi-locus informativeness measures for ancestry inference. These measures describe the potential for correct classification of unknown individuals to their source populations, given genetic data on population structure. Motivated by Shannon's axiomatic approach in deriving a unique information measure for communication (Shannon 1948), we first identify a set of intuitively justifiable criteria that any such quantitative information measure should satisfy, and then select measures that comply with these criteria. It is shown that standard information-theoretic measures such as multidimensional mutual information cannot completely account for informativeness when source populations differ in size, necessitating a decision-theoretic approach.
AI at CADE/IJCAR
Authors: Urban Josef
Published: January 2018

This text briefly discusses and criticizes the prevailing attitudes towards AI and Machine Learning research in the current Automated Reasoning (CADE/IJCAR) community.
Boosting the Performance of SLS and CDCL Solvers by Preprocessor Tuning
Authors: Balint Adrian , Manthey Norbert
Published: January 2018

Preprocessing techniques are crucial for SAT solvers when it comes to reaching state-

of-the-art performance as it was shown by the results of the last SAT Competitions. The

usefulness of a preprocessing technique depends highly on its own parameters, on the in-

stances on which it is applied and on the used solver. In this paper we first give an extended

analysis of the performance gain reached by using different preprocessing techniques in-

dividually in combination with CDCL solvers on application instances and SLS solvers

on crafted instances. Further, we provide an analysis of combinations of preprocessing

techniques by means of automated algorithm configuration, where we search for optimal

preprocessor configurations for different scenarios. Our results show that the performance

of CDCL and especially of SLS solvers can be further improved when using appropriate

preprocessor configurations. The solvers augmented with the best found preprocessing

configurations outperform the original solvers on the instances from the SAT Challenge

2012, achieving new state-of-the-art results.
Bidirectional Functional Semantics for Pregroup Grammars
Authors: Gaudreault Gabriel
Published: January 2018

Pregroup grammars are a recent descendant of the original categorial grammars of Bar-Hillel [1] and Lambek [10] in which types take the form of strings of basic types and left and right adjoints, as opposed to the non-commutative functional types of categorial grammars. Whereas semantic extraction is possible in other categorial grammars through the λ-calculus, this approach will not be feasible for pregroup grammars. In this paper, we show how to build a term calculus that could be used to fill this void. This system is inspired by the λ-calculus but differs in crucial aspects: it uses function composition as its main reduction strategy instead of function application and is bidirectional, i.e. the direction arguments are applied to terms matters. We show how this term calculus is one- to-one with a proper subset of pregroup types and give multiple examples to show how this system could be used to do semantic analysis in parallel to doing grammaticality checks with pregroup grammars.
Closing the Gap Between Specification and Programming: VDM++ and Scala
Authors: Havelund Klaus
Published: January 2018

We argue that a modern programming language such as Scala offers a level of succinctness, which makes it suitable for program and systems specification as well as for high-level programming. We illustrate this by comparing the language with the VDM++ specification language. The comparison also identifies areas where Scala perhaps could be improved, inspired by VDM++. We furthermore illustrate Scala's potential as a specification language by augmenting it with

a combination of parameterized state machines and temporal logic, defined as a library, thereby forming an expressive but simple runtime verification framework.
Three years of experience with Sledgehammer, a Practical Link Between Automatic and Interactive Theorem Provers
Authors: Paulson Lawrence C. , Blanchette Jasmin Christian
Published: January 2018

Sledgehammer is a highly successful subsystem of Isabelle/HOL that calls automatic theorem provers to assist with interactive proof construction. It requires no user configuration: it can be invoked with a single mouse gesture at any point in a proof. It automatically finds relevant lemmas from all those currently available. An unusual aspect of its architecture is its use of unsound translations, coupled with its delivery of results as Isabelle/HOL proof scripts: its output cannot be trusted, but it does not need to be trusted. Sledgehammer works well with Isar structured proofs and allows beginners to prove challenging theorems.
Specifying Hyperdocuments with Algebraic Methods
Authors: Mattick Volker
Published: January 2018

Algebraic specification methods, well-known in the area of programming languages, are adapted to present a tailored framework for hyperdocuments and hyperdocument systems. In this framework, a hyperdocument is defined via its abstract syntax, which is a variable-free term of a suitable constructor-based signature. Both the representation in a markup language and the graphical presentation on the screen as well as further representations are elements of particular algebraic interpretations of the same signature. This technique allows the application of well-known methods from the field of compiler construction to the development of hyperdocument systems. Ideas for its implementation in the functional language Haskell are roughly drafted. It is shown how XML-based markup languages with schemas and stylesheets can be defined in terms of this framework and how this framework can be extended so that it can deal with partially specified documents, called semi documents. These semi documents can be automatically adapted to the users' needs, which e.g. is helpful to ensure accessibility.
Proof theory for lattice-ordered groups
Authors: Metcalfe George
Published: January 2018

Proof theory can provide useful tools for tackling problems in algebra. In particular, Gentzen systems admitting cut-elimination

have been used to establish decidability, complexity, amalgamation, admissibility, and generation results for varieties of residuated lattices corresponding to substructural logics. However, for classes of algebras bearing some family resemblance to groups, such as lattice-ordered groups, MV-algebras, BL-algebras, and cancellative residuated lattices, the proof-theoretic approach has met so far only with limited success.

The main aim of this talk will be to introduce proof-theoretic methods for the class of lattice-ordered groups and to explain how these methods can be used to obtain new syntactic proofs of two core theorems: namely, Holland's result that this class is generated as a variety by the lattice-ordered group of order-preserving automorphisms of the real numbers, and the decidability of the word problem for free lattice-ordered groups.
The Frame Problem and the Semantics of Classical Proofs
Authors: White Graham
Published: January 2018

We outline the logic of current approaches to the so-called

``frame problem'' (that is, the problem of predicting change in the

physical world by using logical inference), and we show that

these approaches are not completely extensional since

none of them is closed under uniform substitution. The underlying difficulty

is something known, in the philosophical community, as Goodman's``new riddle of induction'' or the ``Grue paradox''. Although it seems, from the philosophical discussion, that this paradox cannot be solved in purely a priori terms and that a solution will require some form of real-world data, it nevertheless remains obscure both what the logical form of this real-world data might be, and also how this data actually interacts with logical deduction. We show, using work of McCain and Turner, that this data can be captured using the semantics of classical proofs developed by Bellin, Hyland and Robinson, and, consequently, that the appropriate arena for solutions of the frame problem lies in proof theory. We also give a very explicit model for the categorical semantics of classical proof theory using techniques derived from work on the frame problem.
LOOPUS - A Tool for Computing Loop Bounds for C Programs
Authors: Sinn Moritz , Zuleger Florian
Published: January 2018

We describe the current state of our tool LOOPUS which computes loop bounds for C programs.
Towards a Reliable Formal Framework for Enhancing Risk Assessment in Access Control Systems
Authors: Evina Pierrette Annie , Labbene Ayachi Faten , Jaidi Faouzi , Bouhoula Adel
Published: January 2018

The constant evolution of access control requirements and the dynamic environment in which they evolve require nowadays quick and instant decision-making related to risk of illegitimate access in Information Systems. Various contributions defined in the literature aim to overcome or to mitigate related risks and paradoxically adopted the hypothesis of reliability and validity of access control policies. However, the corruption of these policies is a security aspect of great importance and should be handled actively because (i) an access control policy is also exposed to the same threats as the managed data is and (ii) properties and parameters of the concrete policy at a given stage may differ, in a critical manner, from a reference stage. We define a reliable and complete solution for risk management in the context of Database Servers. We intend to define a rigorous risk management approach that mainly verifies recommendations of the standard ISO 31000:2009. Our approach takes into consideration all identified threats on a Database Server and provides an environment for the analysis of the correlation

between the threats detected in particular by different security devices.

To ensure a high level of surety, we opt for defining a formal framework that allows to efficiently address this problematic and to formally represent and verify our risk management

processes.
From Parallel SAT to Distributed SAT
Authors: Hamadi Youssef
Published: January 2018

This tutorial will present an overview of parallelism in SAT. It will start with a presentation of classical divide and conquer techniques, discuss their ancient origin and compare them to more recent portfolio- based algorithms. It will then present the impact of clause-sharing on their performances and discuss various strategies used to control the communication overhead. A particular technique used to control the classical diversification/intensification tradeoff will also be presented. Finally, perspectives will be given which will relate the current parallel SAT technologies to the expected evolution of computational platforms, leading to distributed SAT solving scenarios.
Strong 0-dimensionality in Pointfree Topology
Authors: Banaschewski Bernhard
Published: January 2018

Classically, a Tychonoff space is called strongly 0-dimensional if its Stone-Cech compactification is 0-dimensional, and given the familiar relationship between spaces and frames it is then natural to call a completely regular frame strongly 0-dimensional if its compact completely regular coreflection is 0-dimensional (meaning: is generated by its complemented elements). Indeed, it is then seen immediately that a Tychonoff space is strongly 0-dimensional iff the frame of its open sets is strongly 0-dimensional in the present sense. This talk will provide an account of various aspects of this notion.
Stronger Automation for Flyspeck by Feature Weighting and Strategy Evolution
Authors: Kaliszyk Cezary , Urban Josef
Published: January 2018

Two complementary AI methods are used to improve the strength of the AI/ATP service for proving conjectures over the HOL Light and Flyspeck corpora. First, several schemes for frequency-based feature weighting are explored in combination with distance-weighted k-nearest-neighbor classifier. This results in 16% improvement (39.0% to 45.5% Flyspeck problems solved) of the overall strength of the service when using 14 CPUs and 30 seconds. The best premise-selection/ATP combination is improved from 24.2% to 31.4%, i.e. by 30%. A smaller improvement is obtained by evolving targetted E prover strategies on two particular premise selections, using the Blind Strategymaker (BliStr) system. This raises the performance of the best AI/ATP method from 31.4% to 34.9%, i.e. by 11%, and raises the current 14-CPU power of the service to 46.9%.
Nonlinear Hybrid Automata Model of Excitable Cardiac Tissue
Authors: Abbas Houssam , Jang Kuk Jin , Mangharam Rahul
Published: January 2018

Implantable cardiac devices like pacemakers and defibrillators are life-saving medical devices.

To verify their functionality, there is a need for heart models that can simulate interesting phenomena and are relatively computationally tractable.

In this benchmark we implement a model of the electrical activity in excitable cardiac tissue as a network of nonlinear hybrid automata.

The model has previously been shown to simulate fast arrhythmias.

The hybrid automata are arranged in a square n-by-n grid and communicate via their voltages.

Our Matlab implementation allows the user to specify any size of model n, thus rendering it ideal for benchmarking purposes since we can study tool efficiency as a function of size.

We expect the model to be used to analyze parameter ranges and network connectivity that lead to dangerous heart conditions.

It can also be connected to device models for device verification.
Unification and Anti-unification modulo Equational Theories
Authors: Escobar Santiago
Published: January 2018

Automated reasoning modulo an equational theory E is a fundamental technique in many applications. In this talk, we would present a narrowing-based equational unification algorithm for theories satisfying the finite variant property. We also talk about equational generalization, also called anti-unification
Composable Packages for Higher Order Logic Theories
Authors: Hurd Joe
Published: January 2018

Interactive theorem proving is tackling ever larger formalization and verification projects, and there is a critical need for theory engineering techniques to support these efforts. One such technique is effective package management, which has the potential to simplify the development of logical theories by precisely checking dependencies and promoting re-use. This paper introduces a domain-specific language for defining composable packages of higher order logic theories, which is designed to naturally handle the complex dependency structures that often arise in theory development. The package composition language functions as a module system for theories, and the paper presents a well-defined semantics for the supported operations. Preliminary tests of the package language and its toolset have been made by packaging the theories distributed with the HOL Light theorem prover. This experience is described, leading to some initial theory engineering discussion on the ideal properties of a reusable theory.
A new Glivenko Theorem
Authors: Alizadeh Majid , Ardeshir Mohammad , Ruitenburg Wim
Published: January 2018

We generalize the double negation construction of Boolean algebras in Heyting

algebras, to a double negation construction of the same in Visser algebras (also

known as basic algebras).

This result allows us to generalize Glivenko's Theorem from intuitionistic

propositional logic and Heyting algebras to Visser's basic propositional logic

and Visser algebras.