Log in

Relevant bibliographies by topics / Automatic proving / Journal articles

To see the other types of publications on this topic, follow the link: Automatic proving.

Journal articles on the topic 'Automatic proving'

Author: Grafiati

Published: 4 June 2021

Last updated: 3 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 journal articles for your research on the topic 'Automatic proving.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.

1

Voronkov, A. A., and A. I. Degtyarev. "Automatic theorem proving. II." Cybernetics 23, no. 4 (1988): 547–56. http://dx.doi.org/10.1007/bf01078915.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Hsiang, Jieh, and Mandayam Srivas. "Automatic inductive theorem proving using prolog." Theoretical Computer Science 54, no. 1 (1987): 3–28. http://dx.doi.org/10.1016/0304-3975(87)90016-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

GOČ, DANIEL, DANE HENSHALL, and JEFFREY SHALLIT. "AUTOMATIC THEOREM-PROVING IN COMBINATORICS ON WORDS." International Journal of Foundations of Computer Science 24, no. 06 (2013): 781–98. http://dx.doi.org/10.1142/s0129054113400182.

Full text

Abstract:

We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using finite automata and a software package for manipulating them. We illustrate our technique by applying it to (a) solve an open problem of Currie and Saari on the lengths of unbordered factors in the Thue-Morse sequence; (b) verify an old result of Prodinger and Urbanek on the regular paperfolding sequence; (c) find an explicit expression for the recurrence function for the Rudin-Shapiro sequence; and (d) improve the avoidance bound in Leech's squarefree sequence. We also introduce a new m

APA, Harvard, Vancouver, ISO, and other styles

4

Li, Yongjian, Kaiqiang Duan, David N. Jansen, et al. "An Automatic Proving Approach to Parameterized Verification." ACM Transactions on Computational Logic 19, no. 4 (2018): 1–25. http://dx.doi.org/10.1145/3232164.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Sutcliffe, Geoff. "The 10th IJCAR automated theorem proving system competition – CASC-J10." AI Communications 34, no. 2 (2021): 163–77. http://dx.doi.org/10.3233/aic-201566.

Full text

Abstract:

The CADE ATP System Competition (CASC) is the annual evaluation of fully automatic, classical logic Automated Theorem Proving (ATP) systems. CASC-J10 was the twenty-fifth competition in the CASC series. Twenty-four ATP systems and system variants competed in the various competition divisions. This paper presents an outline of the competition design, and a commentated summary of the results.

APA, Harvard, Vancouver, ISO, and other styles

6

Dailler, Sylvain, Claude Marché, and Yannick Moy. "Lightweight Interactive Proving inside an Automatic Program Verifier." Electronic Proceedings in Theoretical Computer Science 284 (November 27, 2018): 1–15. http://dx.doi.org/10.4204/eptcs.284.1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Sands, David. "Proving the correctness of recursion-based automatic program transformations." Theoretical Computer Science 167, no. 1-2 (1996): 193–233. http://dx.doi.org/10.1016/0304-3975(96)00074-6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Mantsivoda, A. V. "M-calculus ? a sequent method for automatic theorem proving." Cybernetics and Systems Analysis 29, no. 1 (1993): 130–36. http://dx.doi.org/10.1007/bf01130096.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Urdang, EG. "AI and expertise: heuristic search, inference engines, automatic proving." Information and Software Technology 32, no. 9 (1990): 638. http://dx.doi.org/10.1016/0950-5849(90)90212-a.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Baranovskii, A. I. "Using the VIRT programming language for automatic theorem proving." Cybernetics and Systems Analysis 35, no. 6 (1999): 918–29. http://dx.doi.org/10.1007/bf02742284.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Edwald, Tryggvi. "The t-variable method in gentzen-style automatic theorem proving." Zeitschrift für Mathematische Logik und Grundlagen der Mathematik 36, no. 3 (1990): 253–61. http://dx.doi.org/10.1002/malq.19900360310.

Full text

APA, Harvard, Vancouver, ISO, and other styles

12

Nie, Xumin, and David A. Plaisted. "Refinements to depth-first iterative-deepening search in automatic theorem proving." Artificial Intelligence 41, no. 2 (1989): 223–35. http://dx.doi.org/10.1016/0004-3702(89)90011-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Markoski, Branko, Petar Hotomski, Dusan Malbaski, and Danilo Obradovic. "Resolution methods in proving the program correctness." Yugoslav Journal of Operations Research 17, no. 2 (2007): 275–85. http://dx.doi.org/10.2298/yjor0702275m.

Full text

Abstract:

Program testing determines whether its behavior matches the specification, and also how it behaves in different exploitation conditions. Proving of program correctness is reduced to finding a proof for assertion that given sequence of formulas represents derivation within a formal theory of special predicted calculus. A well-known variant of this conception is described: correctness based on programming logic rules. It is shown that programming logic rules may be used in automatic resolution procedure. Illustrative examples are given, realized in prolog-like LP-language (with no restrictions t

APA, Harvard, Vancouver, ISO, and other styles

14

Markoski, Branko, Petar Hotomski, Dusan Malbaski, and Danilo Obradovic. "Dijkstra's interpretation of the approach to solving a problem of program correctness." Yugoslav Journal of Operations Research 20, no. 2 (2010): 229–36. http://dx.doi.org/10.2298/yjor1002229m.

Full text

Abstract:

Proving the program correctness and designing the correct programs are two connected theoretical problems, which are of great practical importance. The first is solved within program analysis, and the second one in program synthesis, although intertwining of these two processes is often due to connection between the analysis and synthesis of programs. Nevertheless, having in mind the automated methods of proving correctness and methods of automatic program synthesis, the difference is easy to tell. This paper presents denotative interpretation of programming calculation explaining semantics by

APA, Harvard, Vancouver, ISO, and other styles

15

Sutcliffe, Geoff. "The CADE ATP System Competition — CASC." AI Magazine 37, no. 2 (2016): 99–101. http://dx.doi.org/10.1609/aimag.v37i2.2620.

Full text

Abstract:

The CADE ATP System Competition (CASC) is an annual evaluation of fully automatic automated theorem proving (ATP) systems for classical logic — the world championship for such systems. CASC provides a public evaluation of the relative capabilities of ATP systems, and aims stimulate ATP research towards the development of more powerful ATP systems. Over the years CASC has been a catalyst for impressive improvements in ATP.

APA, Harvard, Vancouver, ISO, and other styles

16

Talari, S., S. S. Amiripalli, P. Sirisha, D. Sateesh Kumar, and V. Krishna Deepika. "AN IMPROVED CIPHER BASED AUTOMATIC THEOREM PROVING TECHNIQUE FOR ENCRYPTION AND DECRYPTION." Advances in Mathematics: Scientific Journal 9, no. 5 (2020): 3121–34. http://dx.doi.org/10.37418/amsj.9.5.71.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Pastre, Dominique. "MUSCADET: An automatic theorem proving system using knowledge and metaknowledge in mathematics." Artificial Intelligence 38, no. 3 (1989): 257–318. http://dx.doi.org/10.1016/0004-3702(89)90035-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Li, Mengjun. "Automatic proving or disproving equality loop invariants based on finite difference techniques." Information Processing Letters 115, no. 4 (2015): 468–74. http://dx.doi.org/10.1016/j.ipl.2014.11.006.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

GOČ, DANIEL, NARAD RAMPERSAD, MICHEL RIGO, and PAVEL SALIMOV. "ON THE NUMBER OF ABELIAN BORDERED WORDS (WITH AN EXAMPLE OF AUTOMATIC THEOREM-PROVING)." International Journal of Foundations of Computer Science 25, no. 08 (2014): 1097–110. http://dx.doi.org/10.1142/s0129054114400267.

Full text

Abstract:

In the literature, many bijections between (labeled) Motzkin paths and various other combinatorial objects are studied. We consider abelian (un)bordered words and show the connection with irreducible symmetric Motzkin paths and paths in ℤ not returning to the origin. This study can be extended to abelian unbordered words over an arbitrary alphabet and we derive expressions to compute the number of these words. In particular, over a 3-letter alphabet, the connection with paths in the triangular lattice is made. Finally, we characterize the lengths of the abelian unbordered factors occurring in

APA, Harvard, Vancouver, ISO, and other styles

20

DE ANGELIS, EMANUELE, FABIO FIORAVANTI, ALBERTO PETTOROSSI, and MAURIZIO PROIETTI. "Proving correctness of imperative programs by linearizing constrained Horn clauses." Theory and Practice of Logic Programming 15, no. 4-5 (2015): 635–50. http://dx.doi.org/10.1017/s1471068415000289.

Full text

Abstract:

AbstractWe present a method for verifying the correctness of imperative programs which is based on the automated transformation of their specifications. Given a program prog, we consider a partial correctness specification of the form {ϕ}, prog {ψ}, where the assertions ϕ and ψ are predicates defined by a set Spec of possibly recursive Horn clauses with linear arithmetic (LA) constraints in their premise (also called constrained Horn clauses). The verification method consists in constructing a set PC of constrained Horn clauses whose satisfiability implies that {ϕ}, prog, {ψ} is valid. We high

APA, Harvard, Vancouver, ISO, and other styles

21

B.S. Turusbekov and Ih.Sh. Kadyrov. "EXPERIMENTAL PERFORMANCE RESEARCH AUTOMATIC PROCESS CONTROL SYSTEM IN A PROCESS ON A LATHE." Herald of KSUCTA n a N Isanov, no. 4 (December 16, 2019): 599–604. http://dx.doi.org/10.35803/1694-5298.2019.4.599-604.

Full text

Abstract:

This article contains materials on experimental research of efficiency of the automatic system developed by us at turning [1]. The processing of a step part was carried out on 1K62 lathe with and without automatic system. Thus the corresponding results proving efficiency of application of automatic control system of machine operation modes were received: increase of accuracy of geometrical sizes, decrease of roughness of a surface of a detail. The developed automatic system on the basis of received results of the experiment can be recommended for application on other types of machine tools.

APA, Harvard, Vancouver, ISO, and other styles

22

Byszewski, Jakub, and Jakub Konieczny. "Automatic Sequences and Generalised Polynomials." Canadian Journal of Mathematics 72, no. 2 (2019): 392–426. http://dx.doi.org/10.4153/s0008414x19000038.

Full text

Abstract:

AbstractWe conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are ultimately periodic.Using methods from ergodic theory, we are able to partially resolve this conjecture, proving that any hypothetical counterexample is periodic away from a very sparse and structured set. In particular, we show that for a polynomial $p(n)$ with at least one irrational coefficient (except for the constant one) and integer $m\geqslant 2$, the sequence $\lfloor p(n)\rfloor \hspace{0.2em}{\rm mod}\hspace{0.2em}m$ is never automatic.

APA, Harvard, Vancouver, ISO, and other styles

23

Gan, Wenbin, Xinguo Yu, and Mingshu Wang. "Automatic Understanding and Formalization of Plane Geometry Proving Problems in Natural Language: A Supervised Approach." International Journal on Artificial Intelligence Tools 28, no. 04 (2019): 1940003. http://dx.doi.org/10.1142/s0218213019400037.

Full text

Abstract:

Automatically understanding natural language problems is a long-standing challenging research problem in automatic solving. This paper models the understanding of geometry problems as a problem of relation extraction, instead of as the problem of semantic understanding of natural language. Then it further proposes a supervised machine learning method to extract geometric relations, targeting to produce a group of relations to represent the given geometry problem. This method identifies the actual geometric relations from the relation candidates using a classifier trained from the labelled exam

APA, Harvard, Vancouver, ISO, and other styles

24

VUKOBRATOVIC, MIOMIR K. "NIKOLA TESLA AND ROBOTICS." International Journal of Humanoid Robotics 04, no. 04 (2007): 815–30. http://dx.doi.org/10.1142/s0219843607001242.

Full text

Abstract:

The paper analyzes some of Tesla's works and his most remarkable views concerning the problem of formulating theoretical bases of automatic control. As a tribute to Tesla's work on remote control of automated systems, as well to his (at the time) far-seeing visions, special attention is paid to solving the complex problem of control and feedback application. A more detailed discussion of the way and origin of formulating theoretical bases of automatic control is given. Besides, in more detail are presented the related pioneering works of Professor Nicholas Bernstein, great Russian physiologist

APA, Harvard, Vancouver, ISO, and other styles

25

Vukobratovic, Miomir. "Nikola Tesla and robotics." Serbian Journal of Electrical Engineering 3, no. 2 (2006): 163–75. http://dx.doi.org/10.2298/sjee0603163v.

Full text

Abstract:

The paper analyzes some of Tesla's works and his most remarkable views concerning the problem of formulating theoretical bases of automatic control. As a tribute to Tesla's work on remote control of automated systems, as well to his (at the time) far-seeing visions, special attention is paid to solving complex problem of control and feedback application. A more detailed discussion of the way and origin of formulating theoretical bases of automatic control are given. Besides, in more detail are presented the related pioneering works of Professor Nicholas Bernstein, great Russian physiologist wh

APA, Harvard, Vancouver, ISO, and other styles

26

Rahmania, Yusi Luluk, Tjahjono Kuntjoro, and Valentinus Suroto. "Proving the Accuracy and Legal Liability of Clinical Laboratory Examination Results Using Automatic Tools." SOEPRA 5, no. 2 (2020): 358. http://dx.doi.org/10.24167/shk.v5i2.2565.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

May, Zazilah, and Mohamad Firdaus Mohamad Roselee. "Automatic Meter Reader Using Zigbee." Applied Mechanics and Materials 303-306 (February 2013): 991–94. http://dx.doi.org/10.4028/www.scientific.net/amm.303-306.991.

Full text

Abstract:

The real-time monitoring of a data is crucial in ensuring the accuracy of the acquired data. It determines whether the device is properly working or in fault. This paper proposed the design and implementation of a ZigBee-based wireless automatic meter reading system. It focuses on the development of a device that is capable of monitoring meter reader remotely. It sends the data hourly or daily using Zigbee as the transmitting medium. The proposed device uses software; XCTU, Arduino Programming Language, Multisim and hardware; Microcontroller, Pulse generating circuit, Zigbee antenna, 16X2 LCD

APA, Harvard, Vancouver, ISO, and other styles

28

Ta, Vinh Thong, Levente Buttyán, and Amit Dvir. "On Formal and Automatic Security Verification of WSN Transport Protocols." ISRN Sensor Networks 2014 (March 4, 2014): 1–20. http://dx.doi.org/10.1155/2014/891467.

Full text

Abstract:

We address the problem of formal and automated security verification of transport protocols for wireless sensor networks (WSN) that may perform cryptographic operations. The verification of this class of protocols is difficult because they typically consist of complex behavioral characteristics, such as real-time, probabilistic, and cryptographic operations. To solve this problem, we propose a probabilistic timed calculus for cryptographic protocols and demonstrate how to use this formal language for proving security or vulnerability of protocols. The main advantage of the proposed language is

APA, Harvard, Vancouver, ISO, and other styles

29

Snyers and Thayse. "Algorithmic State Machine Design and Automatic Theorem Proving: Two Dual Approaches to the Same Activity." IEEE Transactions on Computers C-35, no. 10 (1986): 853–61. http://dx.doi.org/10.1109/tc.1986.1676676.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Mironov, Nikita, and Daria Petrosova. "Economic Efficiency of Automated Individual Heating Substation (IHS)." Applied Mechanics and Materials 725-726 (January 2015): 1285–91. http://dx.doi.org/10.4028/www.scientific.net/amm.725-726.1285.

Full text

Abstract:

District heating is widespread in Russia, but to improve the energy efficiency of heat supply current is the transition from district heating to modern individual heating substation (IHS) with automatic regulation of heat - more cost-effective heating system.This article provides a description of the automatic IHS, its advantages over the district heating and calculation of the economy of heat when it is installed. As a result, the calculation result is obtained, proving the feasibility of using such a system.

APA, Harvard, Vancouver, ISO, and other styles

31

Tatas, K., K. Siozios, A. Bartzas, C. Kyriacou, and D. Soudris. "A Novel Prototyping and Evaluation Framework for NoC-Based MPSoC." International Journal of Adaptive, Resilient and Autonomic Systems 4, no. 3 (2013): 1–24. http://dx.doi.org/10.4018/jaras.2013070101.

Full text

Abstract:

This paper presents a framework for high-level exploration, Register Transfer-Level (RTL) design and rapid prototyping of Network-on-Chip (NoC) architectures. From the high-level exploration, a selected NoC topology is derived, which is then implemented in RTL using an automated design flow. Furthermore, for verification purposes, appropriate self-checking testbenches for the verification of the RTL and architecture files for the semi-automatic implementation of the system in Xilinx EDK are also generated, significantly reducing design and verification time, and therefore Non-Recurring Enginee

APA, Harvard, Vancouver, ISO, and other styles

32

Tihanov, Galin. "STUDY ON THE EFFECT OF THE TYPE OF FULL HOPPER SIGNALLING USED IN GRAIN HARVESTERS ON THE TIME FOR THE GRAIN HOPPER UNLOADING." Applied Researches in Technics, Technologies and Education 6, no. 4 (2018): 294–99. http://dx.doi.org/10.15547/artte.2018.04.002.

Full text

Abstract:

The paper has established the length of the time for unloading hoppers in harvesters using a different signaling mode for full hopper: without automatic signalling - 245.35 s; with one level of automatic signalling - 224.5 s; with two levels of automatic signalling - 208.82 s and for harvesters unloading in the vehicle located at the end of the field - 301.46 s. Dispersion analysis has been carried out proving the effect of the type of signalling for full hopper used on the total time for unloading the hopper at a significance level of a = 0.05. Through it the interaction between the factor: t

APA, Harvard, Vancouver, ISO, and other styles

33

Gauhar, Ayesha, Adnan Rashid, Osman Hasan, João Bispo, and João M. P. Cardoso. "Formal verification of Matrix based MATLAB models using interactive theorem proving." PeerJ Computer Science 7 (March 22, 2021): e440. http://dx.doi.org/10.7717/peerj-cs.440.

Full text

Abstract:

MATLAB is a software based analysis environment that supports a high-level programing language and is widely used to model and analyze systems in various domains of engineering and sciences. Traditionally, the analysis of MATLAB models is done using simulation and debugging/testing frameworks. These methods provide limited coverage due to their inherent incompleteness. Formal verification can overcome these limitations, but developing the formal models of the underlying MATLAB models is a very challenging and time-consuming task, especially in the case of higher-order-logic models. To facilita

APA, Harvard, Vancouver, ISO, and other styles

34

Vroomen, L., P. Zsombor-Murray, P. Baracos, and R. Hudson. "Comments on "Algorithmic state machine design and automatic theorem proving: dual approaches to the same activity." IEEE Transactions on Computers 38, no. 6 (1989): 880–81. http://dx.doi.org/10.1109/12.24299.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Carrillo-Mondejar, Javier, Juan Manuel Castelo Gomez, Carlos Núñez-Gómez, Jose Roldán Gómez, and José Luis Martínez. "Automatic Analysis Architecture of IoT Malware Samples." Security and Communication Networks 2020 (October 26, 2020): 1–12. http://dx.doi.org/10.1155/2020/8810708.

Full text

Abstract:

The weakness of the security measures implemented on IoT devices, added to the sensitivity of the data that they handle, has created an attractive environment for cybercriminals to carry out attacks. To do so, they develop malware to compromise devices and control them. The study of malware samples is a crucial task in order to gain information on how to protect these devices, but it is impossible to manually do this due to the immense number of existing samples. Moreover, in the IoT, coexist multiple hardware architectures, such as ARM, PowerPC, MIPS, Intel 8086, or x64-86, which enlarges eve

APA, Harvard, Vancouver, ISO, and other styles

36

Jayalakshmi, S., and Ananthi Sheshaayee. "Exploring the Web and Semantic Knowledge-Driven Automatic Question Answering System." International Journal of Engineering & Technology 7, no. 3.6 (2018): 379. http://dx.doi.org/10.14419/ijet.v7i3.6.16007.

Full text

Abstract:

The growth of information retrieval from the web sources are increased day by day, proving an effective and efficient way to the user for retrieving relevant documents from the web is an art. Asking the right question and retrieving a right answer to the posted query is a service which provide by the Natural Language Processing. Question Answering System is one of the best ways to identify the candidate answer with high accuracy. The web and Semantic Knowledge Driven Question Answering System (QAS) used to determine the candidate answer for the posted query in the NLP tools. This method includ

APA, Harvard, Vancouver, ISO, and other styles

37

Xu, Shi Wei, Huan Guo Zhang, Zheng Dai, Xin Fa Dai, and Jing Dong Chen. "Modeling and Reasoning about States in Late Launch Based on Horn Clauses." Advanced Materials Research 915-916 (April 2014): 1350–56. http://dx.doi.org/10.4028/www.scientific.net/amr.915-916.1350.

Full text

Abstract:

Late Launch, which is a kind of dynamic measurement technology proposed by both Intel and AMD, offers isolated execution environment for codes needed to be protected. However, since the specifications and documents of Late Launch have hundreds of pages, they are too long and complicated to be fully covered and analyzed. A model based on Horn clauses is presented to solve the problem that there is a lack of realistic models and of automated tools for the verification of security protocols based on Late Launch. A running example is taken to show the execution details of Late Launch. Based on the

APA, Harvard, Vancouver, ISO, and other styles

38

Otero, Roi, Ernesto Frías, Susana Lagüela, and Pedro Arias. "Automatic gbXML Modeling from LiDAR Data for Energy Studies." Remote Sensing 12, no. 17 (2020): 2679. http://dx.doi.org/10.3390/rs12172679.

Full text

Abstract:

This paper proposes an efficient and simplified procedure for the 3D modelling of buildings, based on the semi-automatic processing of point clouds acquired with mobile LiDAR scanners. The procedure is designed with the aim at generating BIM, in gbXML format, from the point clouds. In this way, the main application of the procedure is the performance of energy analysis, towards the increase of the energy efficiency in the construction sector, and its consequent contribution to the mitigation of the climate change. Thus, the main contribution of the methodology proposed is its easiness of use a

APA, Harvard, Vancouver, ISO, and other styles

39

Hetti Arachchige, N., and S. Perera. "Automatic modelling of building façade objects via primitive shapes." ISPRS - International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences XL-3 (August 11, 2014): 115–20. http://dx.doi.org/10.5194/isprsarchives-xl-3-115-2014.

Full text

Abstract:

This paper presents a new approach to recognize individual façade objects and to reconstruct such objects in 3D using MLS point clouds. Core of the approach is a primitive shape based algorithm, which introduces building primitives, to identify the façade objects separately from other irrelevant objects and then to model the correct topology. The primitive shape is identified against defined different primitive shapes by using the Douglas-Peucker algorithm. The advantage of this process is that it offers an ability not only to model correct geometric shapes but also to remove occlusion effects

APA, Harvard, Vancouver, ISO, and other styles

40

CULIK II, KAREL, and JUHANI KARHUMÄKI. "ITERATIVE DEVICES GENERATING INFINITE WORDS." International Journal of Foundations of Computer Science 05, no. 01 (1994): 69–97. http://dx.doi.org/10.1142/s0129054194000050.

Full text

Abstract:

We consider various TAG-like devices that generate one-way infinite words in real time. The simplest types of these devices are equivalent to iterative morphisms (also called substitutions), automatic sequences and iterative DGSM’s. We consider also a few new types. Mainly we study the comparative power of these mechanisms and develop some techniques for proving that certain devices cannot produce a particular infinite word.

APA, Harvard, Vancouver, ISO, and other styles

41

Hernando, M. Elena, Gema García-Sáez, Iñaki Martínez-Sarriegui, et al. "Automatic Data Processing to Achieve a Safe Telemedical Artificial Pancreas." Journal of Diabetes Science and Technology 3, no. 5 (2009): 1039–46. http://dx.doi.org/10.1177/193229680900300507.

Full text

Abstract:

Background: The use of telemedicine for diabetes care has evolved over time, proving that it contributes to patient self-monitoring, improves glycemic control, and provides analysis tools for decision support. The timely development of a safe and robust ambulatory artificial pancreas should rely on a telemedicine architecture complemented with automatic data analysis tools able to manage all the possible high-risk situations and to guarantee the patient's safety. Methods: The Intelligent Control Assistant system (INCA) telemedical artificial pancreas architecture is based on a mobile personal

APA, Harvard, Vancouver, ISO, and other styles

42

Seada, Noha, Safwat Hamad, and Mostafa G. M. Mostafa. "Model-based Automatic Segmentation of Ascending Aorta from Multimodality Medical Data." International Journal of Electrical and Computer Engineering (IJECE) 6, no. 6 (2016): 3161. http://dx.doi.org/10.11591/ijece.v6i6.12598.

Full text

Abstract:

<p>Automatic Ascending Aorta Segmentation is one of the important steps towards automatic segmentation of the whole cardiac tree. This paper presents a novel approach for the automatic segmentation of the ascending aorta from two imaging modalities: CTA (Computed Tomography Angiography) and PC-MRI (Phase-Contrast Magnetic Resonance Images). The novel approach is an algorithm that works without the need for setting manual seed points or applying preprocessing steps or setting a region of interest. Instead, the proposed algorithm automatically detects and segments the ascending aorta using

APA, Harvard, Vancouver, ISO, and other styles

43

Seada, Noha, Safwat Hamad, and Mostafa G. M. Mostafa. "Model-based Automatic Segmentation of Ascending Aorta from Multimodality Medical Data." International Journal of Electrical and Computer Engineering (IJECE) 6, no. 6 (2016): 3161. http://dx.doi.org/10.11591/ijece.v6i6.pp3161-3173.

Full text

Abstract:

<p>Automatic Ascending Aorta Segmentation is one of the important steps towards automatic segmentation of the whole cardiac tree. This paper presents a novel approach for the automatic segmentation of the ascending aorta from two imaging modalities: CTA (Computed Tomography Angiography) and PC-MRI (Phase-Contrast Magnetic Resonance Images). The novel approach is an algorithm that works without the need for setting manual seed points or applying preprocessing steps or setting a region of interest. Instead, the proposed algorithm automatically detects and segments the ascending aorta using

APA, Harvard, Vancouver, ISO, and other styles

44

Li, Jian, and Yongmei Liu. "Automatic Verification of Liveness Properties in the Situation Calculus." Proceedings of the AAAI Conference on Artificial Intelligence 34, no. 03 (2020): 2886–92. http://dx.doi.org/10.1609/aaai.v34i03.5679.

Full text

Abstract:

In dynamic systems, liveness properties concern whether something good will eventually happen. Examples of liveness properties are termination of programs and goal achievability. In this paper, we consider the following theorem-proving problem: given an action theory and a goal, check whether the goal is achievable in every model of the action theory. We make the assumption that there are finitely many non-number objects. We propose to use mathematical induction to address this problem: we identify a natural number feature and prove by mathematical induction that for any values of the feature,

APA, Harvard, Vancouver, ISO, and other styles

45

Bucolo, Maide, Arturo Buscarino, Carlo Famoso, Luigi Fortuna, and Salvina Gagliano. "Automation of the Leonardo da Vinci Machines." Machines 8, no. 3 (2020): 53. http://dx.doi.org/10.3390/machines8030053.

Full text

Abstract:

Leonardo da Vinci inventions and projects represent an intriguing starting point to remark the concept that innovation must be considered as a continuous route towards evolution in history. Some of the particular ideas and innovations presented by Leonardo da Vinci led us to formulate a link with automatic control. Selected models of the Leonardo da Vinci machines are presented in this paper, taking strictly into account the original mechanical schemes and working principles, but introducing modern low-cost control equipment, emphasizing the role of automatic control and that of electronic con

APA, Harvard, Vancouver, ISO, and other styles

46

Burla, Maria Cristina, Benedetta Carrozzini, Giovanni Luca Cascarano, Carmelo Giacovazzo, and Giampiero Polidori. "Solving crystal structures inP1: an automated procedure for finding an allowed origin in the correct space group." Journal of Applied Crystallography 33, no. 2 (2000): 307–11. http://dx.doi.org/10.1107/s0021889800000157.

Full text

Abstract:

Crystal structure solution inP1 may be particularly suitable for complex crystal structures crystallizing in other space groups. However, additional efforts and human intervention are often necessary to locate correctly the structural model so obtained with respect to an allowed origin of the actual space group. An automatic procedure is described which is able to perform such a task, allowing the routine passage to the correct space group and the subsequent structure refinement. Some tests are presented proving the effectiveness of the procedure.

APA, Harvard, Vancouver, ISO, and other styles

47

CHENEY, JAMES, та ALBERTO MOMIGLIANO. "αCheck: A mechanized metatheory model checker". Theory and Practice of Logic Programming 17, № 3 (2017): 311–52. http://dx.doi.org/10.1017/s1471068417000035.

Full text

Abstract:

AbstractThe problem of mechanically formalizing and proving metatheoretic properties of programming language calculi, type systems, operational semantics, and related formal systems has received considerable attention recently. However, the dual problem of searching for errors in such formalizations has attracted comparatively little attention. In this article, we present αCheck, a bounded model checker for metatheoretic properties of formal systems specified using nominal logic. In contrast to the current state of the art for metatheory verification, our approach is fully automatic, does not

APA, Harvard, Vancouver, ISO, and other styles

48

Feng, Jun, Cheng Gong, Xiaodong Li, and Raymond Y. K. Lau. "Automatic Approach of Sentiment Lexicon Generation for Mobile Shopping Reviews." Wireless Communications and Mobile Computing 2018 (August 12, 2018): 1–13. http://dx.doi.org/10.1155/2018/9839432.

Full text

Abstract:

The dramatic increase in the use of smartphones has allowed people to comment on various products at any time. The analysis of the sentiment of users’ product reviews largely depends on the quality of sentiment lexicons. Thus, the generation of high-quality sentiment lexicons is a critical topic. In this paper, we propose an automatic approach for constructing a domain-specific sentiment lexicon by considering the relationship between sentiment words and product features in mobile shopping reviews. The approach first selects sentiment words and product features from original reviews and mines

APA, Harvard, Vancouver, ISO, and other styles

49

Liu, Ji Hong, Ru Ru Pan, Wei Dong Gao, and Hong Xia Jiang. "A Virtual Woven Fabric of Plain Using Real Float." Applied Mechanics and Materials 43 (December 2010): 760–63. http://dx.doi.org/10.4028/www.scientific.net/amm.43.760.

Full text

Abstract:

The automatic segmentation of flaws and acquisition of parameters in woven fabrics has been achieved. However, the problem is that information of gray information of float is difference with real fabric. It is important to use a fabric that includes the total information of woven fabrics, meanwhile, the fabric was illuminated even. To solve the problem, in this research, images of virtual woven fabrics of plain were developed in order to research the methods of automatic segmentation of flaws and acquisition of parameters in woven fabrics using the images of real woven fabric. The warp and wef

APA, Harvard, Vancouver, ISO, and other styles

50

Washbrook, John. "AI and expertise: heuristic search, inference, automatic proving by H Farreny, 1988, translated by Jonathan Barchan, Ellis Horwood, pp 260, £39.95." Knowledge Engineering Review 5, no. 3 (1990): 216–17. http://dx.doi.org/10.1017/s0269888900005427.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!