522,416 Hits in 7.4 sec

Feasible Automata for Two-Variable Logic with Successor on Data Words [article]

Ahmet Kara, Thomas Schwentick, Tony Tan
2011 arXiv   pre-print
The expressive power of weak data automata corresponds exactly to existential monadic second order logic with successor +1 and data value equality \sim, EMSO2(+1,\sim).  ...  Furthermore, we study weak B\"uchi automata on data omega-strings. They can be characterized by the extension of EMSO2(+1,\sim) with existential quantifiers for infinite sets.  ...  We thank Christof Löding for helpful remarks on automata and logics for ω-words and Thomas Zeume for thorough proof reading.  ... 
arXiv:1110.1221v1 fatcat:eomx3wxgizaidcnlrgbvsklruy

Feasible Automata for Two-Variable Logic with Successor on Data Words [chapter]

Ahmet Kara, Thomas Schwentick, Tony Tan
2012 Lecture Notes in Computer Science  
The expressive power of weak data automata corresponds exactly to existential monadic second order logic with successor +1 and data value equality ∼, EMSO 2 (+1, ∼).  ...  We introduce an automata model for data words, that is words that carry at each position a symbol from a finite alphabet and a value from an unbounded data domain.  ...  In [11] , it is shown that the simple fragment of freeze LTL with one register has the same expressive power as a certain two variable logic.  ... 
doi:10.1007/978-3-642-28332-1_30 fatcat:5pods2csn5e7zdr53mgtekqv6m

Two-Variable Logic on Words with Data

M. Bojanczyk, A. Muscholl, T. Schwentick, Luc Segoufin, C. David
21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)  
It is shown that satisfiability for the two-variable first-order logic FO 2 (∼, <, +1) is decidable over finite and over infinite data words, where ∼ is a binary predicate testing the data value equality  ...  In a data word each position carries a label from a finite alphabet and a data value from some infinite domain.  ...  When more variables are permitted, or when a linear order on the data values is available, or when more than two equivalence relations are present, the logic becomes undecidable.  ... 
doi:10.1109/lics.2006.51 dblp:conf/lics/BojanczykMSSD06 fatcat:2wjyl5jlxngrxfuhecjhfta6tm

Expressiveness of Hybrid Temporal Logic on Data Words

Ahmet Kara, Thomas Schwentick
2011 Electronical Notes in Theoretical Computer Science  
It is shown that there are properties of data words that can be expressed in HTL with two variables but not in LTL ↓ .  ...  Hybrid temporal logic (HTL) on data words can be considered as an extension of the logic LTL ↓ introduced by Demri and Lazic [3] .  ...  We study hybrid temporal logics with future and past temporal operators (HTL) on data words and compare its expressive power with that of LTL ↓ .  ... 
doi:10.1016/j.entcs.2011.10.010 fatcat:64bs54hzsjgzjm3aqvlhhs72qm

Two-Variable Logic with Two Order Relations

Thomas Schwentick, Thomas Zeume, Anuj Dawar
2012 Logical Methods in Computer Science  
A further consequence is that satisfiability of two-variable logic over data words with a linear order on positions and a linear order and successor relation on the data is decidable in EXPSPACE.  ...  As a special case, the EXPSPACE upper bound applies to two-variable logic over structures with two linear orders.  ...  We thank Jan van den Bussche for fruitful discussions and Amaldev Manuel for sharing his results with us.  ... 
doi:10.2168/lmcs-8(1:15)2012 fatcat:j5m6amxmwraihghwy76ej3tzhm

The Mediator Effect of Reading Comprehension in the Relationship between Logical Reasoning and Word Problem Solving

Derya CAN
2020 Participatory Educational Research  
The data were collected through the administration of logical reasoning, syllogistic reasoning, and reading comprehension tests, and word problems.  ...  On the other hand, more research is needed as to determine how logical thinking and word problem solving are related to each other and to analyze the role of reading comprehension in this relationship.  ...  The test has two subtests each with ten items. In one of these subtests, there are items which are about basic level logical syllogisms termed as "modus ponens" and "modus tollens".  ... 
doi:10.17275/per. fatcat:nzoyqnufyfde3euzi3cflclwsy

Satisfiability for MTL and TPTL over Non-monotonic Data Words [chapter]

Claudia Carapelle, Shiguang Feng, Oliver Fernández Gil, Karin Quaas
2014 Lecture Notes in Computer Science  
Words in this class may model the behaviour of, e.g., one-counter machines.  ...  In the context of real-time systems, Metric Temporal Logic (MTL) and Timed Propositional Temporal Logic (TPTL) are prominent and widely used extensions of Linear Temporal Logic.  ...  This is opposed to the decidability result for FreezeLTL with one register variable evaluated over finite data words [10] .  ... 
doi:10.1007/978-3-319-04921-2_20 fatcat:krsoynwz4fgchkdrq7rjkqlhfu

A Rapid Computer Search Technique for Astronomical Catalogs

Walter J. Weller
1964 Publications of the Astronomical Society of the Pacific  
A second word, called the "logic" or "special information" word, is also built during this initial scan.  ...  Upon encountering a valid data item, i.e., one which is not blank, the scan program enters a bit into a special computer word called the "missing items" or "data summary" word.  ...  The two words can be tested on a bit-by-bit basis, but this A test on the presence of one or more, but not necessarily all, of a set of conditions can also be performed with the logical "AND" instruction  ... 
doi:10.1086/128073 fatcat:6o4hzp5gszebrf26sx5sxv7j3y

Checker Generation of Assertions with Local Variables for Model Checking

Sho Takeuchi, Kiyoharu Hamaguchi, Toshinobu Kashiwabara
2009 IPSJ Transactions on System LSI Design Methodology  
We also show experimental results on bounded model checking for our algorithm compared with the previous work by Long and Seawright.  ...  In particular, our algorithm requires only one such variable for each local variable.  ...  This implies 100 storing variables in a checker for each local variable. As compared with their work, our algorithm requires only one storing variable for each local variable.  ... 
doi:10.2197/ipsjtsldm.2.80 fatcat:5lutlzicxbeitebggbadeays3e

AWESOME: Empowering Scalable Data Science on Social Media Data with an Optimized Tri-Store Data System [article]

Xiuwen Zheng, Subhasis Dasgupta, Arun Kumar, Amarnath Gupta
2022 arXiv   pre-print
In this work, we focus on emerging multi-data model analytics workloads over social media data that fluidly straddle relational, graph, and text analytics.  ...  ADIL builds on top of underlying query engines (e.g., SQL and Cypher) and features native data types for succinctly specifying cross-engine queries and NLP operations, as well as automatic in-memory and  ...  ACKNOWLEDGMENTS This work was partly supported by two National Science Foundation Awards (Number #1909875 and #1738411).  ... 
arXiv:2112.00833v3 fatcat:hfjp4uoikzbkpdeyeccp2atvqy

Detecting Logical Inconsistencies by Clustering Technique in Natural Language Requirements

Satoshi MASUDA, Tohru MATSUODANI, Kazuhiko TSUDA
2016 IEICE transactions on information and systems  
By evaluating the logical formulas with input data patterns, we can find logical inconsistencies.  ...  However, paragraphs do not always represent logical chunks. There can be only one logical chunk over some paragraphs on the other hand some logical chunks in one paragraph.  ...  By evaluating the logical formulas with input data patterns, we can find logical inconsistencies. We experimented with this approach on three case studies of requirements written in natural English.  ... 
doi:10.1587/transinf.2015kbp0005 fatcat:s4asdiaouncndk6337c4f3d6xq

A Novel High-order Linguistic Time Series Forecasting Model with the Growth of Declared Word-set

Nguyen Duy Hieu, Pham Dinh Phong
2021 International Journal of Advanced Computer Science and Applications  
This paper examines a novel model of high-order linguistic time series with the growth of declared word-set.  ...  The linguistic forecasting method based on the first-order linguistic time series which can handle directly the word-set of the linguistic variable have been examined by Hieu et al.  ...  Let = (X, G, C, H ≤) be a hedge algebras (HA), where X is the word-domain of a given linguistic variable L ; G is the set of two opposite generators, the negative one denoted by c − and the positive one  ... 
doi:10.14569/ijacsa.2021.0120609 fatcat:22omdfaesrhbfmxfyygi5wai3m

A Novel FPGA-Based Real-Time Simulator for Micro-Grids

2017 Energies  
The data scheduling is carried out following the principle of saving the resources and the minimizing the average distance between variables.  ...  Each input of arithmetic logic unit in FO-RTDS is equipped with a read controller and each output of arithmetic logic units is equipped with a write controller and a buffer channel.  ...  There are eight zones in the data storage unit of microprocessor core (the data inflow area and the data outflow area each have two sets, fast one and slow one), which area the variables are stored in  ... 
doi:10.3390/en10081239 fatcat:n3zf73adsvgm3n7nczsy6fuyuu

Beyond Shapes: Lists with Ordered Data [chapter]

Kshitij Bansal, Rémi Brochenin, Etienne Lozes
2009 Lecture Notes in Computer Science  
We establish decidability for (rst-order) separation logic with a predicate that allows to compare two successive data in a list.  ...  Separation logic, one of the prominent framework for these kind of analysis, proposed a heap model that could represent data, but, to our knowledge, no predicate dealing with data has ever been integrated  ...  These logics are based on dierent classes of models: our separation logic deals with lists with data, whereas the monadic second order logic deals with shapes, e.g. lists without data.  ... 
doi:10.1007/978-3-642-00596-1_30 fatcat:phtob7dtyjcfxjqxkgzkr5cume

On the Design of Three-Valued Asynchronous Modules

Wojcik, Kwang-Ya Fang
1980 IEEE transactions on computers  
Since 1976 he has been engaged in research on multiprocessor systems. His current field of interest is the architecture of these systems, logic design, and multivalued logic. Joep L. W.  ...  He received the M.Sc. degree with honors from the Technological University of Eindhoven, The Netherlands, in 1967.  ...  Hence, given a network of modules, correct operation of the system requires the presence of a'spacer word in at least one module B that is logically between two modules A and C that are processing data  ... 
doi:10.1109/tc.1980.1675472 fatcat:txmyjpaet5b3vhlt7jat2kne6i
« Previous Showing results 1 — 15 out of 522,416 results