Filters








9,426 Hits in 7.1 sec

A Tree Logic with Graded Paths and Nominals [article]

Everardo Barcenas (INRIA Rhône-Alpes / LIG Laboratoire d'Informatique de Grenoble), Pierre Geneves (INRIA Rhône-Alpes / LIG Laboratoire d'Informatique de Grenoble), Nabil Layaida (INRIA Rhône-Alpes / LIG Laboratoire d'Informatique de Grenoble), Alan Schmitt (INRIA Rhône-Alpes / LIG Laboratoire d'Informatique de Grenoble)
2010 arXiv   pre-print
While the combination of graded modalities, nominals, and inverse modalities yields undecidable logics over graphs, we show that these features can be combined in a tree logic decidable in exponential  ...  We present a logic capable of expressing deep counting along paths which may include arbitrary recursive forward and backward navigation.  ...  The µ-calculus has been recently extended with inverse modalities [Var98] , nominals [SV01] , and graded modalities [KSV02] .  ... 
arXiv:1005.5623v1 fatcat:cttrbs66fjcddjnuurq257cv74

The Complexity of Enriched μ-Calculi [chapter]

Piero A. Bonatti, Carsten Lutz, Aniello Murano, Moshe Y. Vardi
2006 Lecture Notes in Computer Science  
The fully enriched µ-calculus is the extension of the propositional µ-calculus with inverse programs, graded modalities, and nominals.  ...  Thus, we identify a family of decidable logics that are maximal (and incomparable) in expressive power.  ...  Introduction The µ-calculus is a propositional modal logic augmented with least and greatest fixpoint operators [Koz83] .  ... 
doi:10.1007/11787006_46 fatcat:6s5ksezv4ncx7nexvwhzjepn34

On the Count of Trees [article]

Everardo Barcenas (INRIA Rhône-Alpes / LIG Laboratoire d'Informatique de Grenoble), Pierre Geneves (INRIA Rhône-Alpes / LIG Laboratoire d'Informatique de Grenoble), Nabil Layaida (INRIA Rhône-Alpes / LIG Laboratoire d'Informatique de Grenoble), Alan Schmitt (INRIA Rhône-Alpes / LIG Laboratoire d'Informatique de Grenoble)
2010 arXiv   pre-print
While the combination of graded modalities, nominals, and inverse modalities yields undecidable logics over graphs, we show that these features can be combined in a decidable tree logic whose main features  ...  We present a logic capable of expressing deep counting along paths which may include arbitrary recursive forward and backward navigation.  ...  A recent study [2] focuses on extending the µ-calculus with inverse modalities [29] , nominals [24] , and graded modalities of [19] .  ... 
arXiv:1008.5073v1 fatcat:v3xydzgacnfbvgpkl5egg676sm

A Counting Logic for Trees

Everardo Barcenas
2015 Journal of Computacion y Sistemas  
By succinct reductions to the logic, we identify several decidable extensions of regular tree languages with counting and interleaving operators.  ...  Contrastively with graded modalities, which restrict the occurrence of immediate successor nodes only, the logic introduced in this paper can concisely express numerical constraints on any tree region,  ...  The fully enriched µ-calculus is an extension consisting of nominals, inverse and graded modalities.  ... 
doi:10.13053/cys-19-2-1999 fatcat:dn336yq2o5ghzo5zsash75d5sm

Global Numerical Constraints on Trees

Everardo Barcenas, Jesus Lavalle, Maurizio Lenzerini
2014 Logical Methods in Computer Science  
We introduce a logical foundation to reason on tree structures with constraints on the number of node occurrences.  ...  This implies a characterization of decidable counting extensions of XPath queries and XML schemas.  ...  This work benefited from the support of Pierre Genevès, Nabil Layaïda, Denis Lugiez and Alan Schmitt.  ... 
doi:10.2168/lmcs-10(2:10)2014 fatcat:g6cthzoufzdebhisvdeewd3awq

Regular Path Queries in Expressive Description Logics with Nominals

Diego Calvanese, Thomas Eiter, Magdalena Ortiz
2009 International Joint Conference on Artificial Intelligence  
Our results carry over also to the DLs of the SR family, and thus have a direct impact on OWL 2.  ...  DLs; specifically: regular expressions and (safe) Booleans over roles, and allowing for the combination of any two constructs among inverse roles, qualified number restrictions, and nominals.  ...  An (infinite) path in F is an (infinite) tree P ⊆ F with bran- ching degree 1. By convention, x • ε = x and (x • i)•−1 = x.  ... 
dblp:conf/ijcai/CalvaneseEO09 fatcat:ptyzm6t5jjc35fts6nh2btzesi

Algorithmic tuning of clock trees and derived non-tree structures

Igor L. Markov, Dong-Jin Lee
2011 2011 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)  
It starts with SPICE-accurate optimizations used in winning entries at the ISPD 2009 and 2010 clock-network synthesis contests.  ...  After comparing clock trees to meshes, it outlines a recent redundant clock-network topology that retains most advantages of clock trees, but improves robustness to PVT variations.  ...  Modeling techniques and algorithms for CPU-grade clock-power optimization in the presence of variations can be found in [15] . Nominal-skew optimization.  ... 
doi:10.1109/iccad.2011.6105342 dblp:conf/iccad/MarkovL11 fatcat:f2mudflhvbdflk5vvydvaikste

Enriched μ-Calculi Module Checking

Ferrante Alessandro, Aniello Murano, Mimmo Parente, Helmut Seidl
2008 Logical Methods in Computer Science  
In this paper, we further investigate this problem with respect to the \mu-calculus enriched with nominals and graded modalities (hybrid graded Mu-calculus), in both the finite-state and infinite-state  ...  We also investigate the module checking problem with respect to the hybrid graded \mu-calculus enriched with inverse programs (Fully enriched \mu-calculus): by showing a reduction from the domino problem  ...  logic (for a survey, see [CGP99] ).  ... 
doi:10.2168/lmcs-4(3:1)2008 fatcat:eyycqts4s5aerg2lz6mwxlkh2m

Satisfiability and Model Checking of CTL* with Graded Path Modalities [article]

Benjamin Aminof, Aniello Murano, Sasha Rubin
2014 arXiv   pre-print
Graded path modalities count the number of paths satisfying a property, and generalize the existential (E) and universal (A) path modalities of CTL*. The resulting logic is called GCTL*.  ...  The significance of this work is two-fold: GCTL* is more expressive than CTL* at no extra cost in computational complexity, and GCTL* has all the advantages over GCTL (CTL with graded path modalities)  ...  First, recall that logics extended with graded world modalities have been further enriched with backward-modalities and with nominals [6] .  ... 
arXiv:1410.7551v1 fatcat:jmxxn6mh5rhpdknjj7hcx4w7bm

Machine Learning for Predictions in Academics

2020 International journal of recent technology and engineering  
This paper discusses some of the machine learning techniques which can be used to predict the performance of a student and help to decide his/her career path.  ...  In recent years, a lot of data has been generated about students, which can be utilized for deciding the career path of the student.  ...  The best technique is Naïve Bayes for the first dataset with 98% accuracy and Decision Trees for second dataset with 78% accuracy.  ... 
doi:10.35940/ijrte.e6965.018520 fatcat:bzt6emnj6bfznejbet56hrtgze

FPGA Design Automation: A Survey

Deming Chen, Jason Cong, Peichen Pan
2006 Foundations and Trends® in Electronic Design Automation  
The designer may start with a small (low capacity) device with a nominal speed-grade.  ...  A tile is a logic block. Each clock tree buffer in the H-tree has two branches. There is a local clock buffer for each flip-flop in a tile.  ... 
doi:10.1561/1000000003 fatcat:pops4k5ddrhvdgklbw2wa2ls4i

Evaluation of voltage interpolation to address process variations

Kevin Brownell, Gu-Yeon Wei, David Brooks
2008 2008 IEEE/ACM International Conference on Computer-Aided Design  
The analysis shows that the scheme can match the nominal delay target with a 10% power cost, or for the same power budget, incur only a 9% delay overhead after variations.  ...  The paper explores the scheme for a 64-core chip-multiprocessor machine using industrial-grade design blocks and shows that the scheme can be used to mitigate overhead arising from random and correlated  ...  Since there is a discrete number of cells along each path, each with a different delay, it is impossible to split the paths into perfectly equal stages.  ... 
doi:10.1109/iccad.2008.4681626 dblp:conf/iccad/BrownellWB08 fatcat:4r4oul2ogffrzaugdipn7a3say

An Effective Application and Analysis Method based on User's Profiles in Elective Subjects

Rikeeta Mahajan, Prof. Priti Subramanium
2017 IJARCCE  
To eliminate this trouble, a beneficial system is planned to develop using fuzzy logic system (FLS).  ...  It is a server operating system produced by Microsoft. Windows Server 2012 R2 supports up to 64 physical processors or up to 256 logical processors per system.  ...  TESTING AND RESULTS A)Unit testing:-It is use to check the execution path of the module, function and procedure of the system. Test is conducted with the help of normal data and abnormal data.  ... 
doi:10.17148/ijarcce.2017.6634 fatcat:nm57ie7uyjea3mwvpdlxig376q

4 Computational modal logic [chapter]

Ian Horrocks, Ullrich Hustadt, Ulrike Sattler, Renate Schmidt
2007 Studies in Logic and Practical Reasoning  
Other extensions (counting, nominals) The modal logics K c n and K ,c n with graded modalities and the modal logic K o n with nominals can be translated to first-order logic using a number of different  ...  ), and NExpTime-complete for K n extended with converse modalities, graded modalities and nominals.  ... 
doi:10.1016/s1570-2464(07)80007-3 fatcat:zrhdgzcgovfc3lxuuqnjpsa5bi

Page 1960 of Psychological Abstracts Vol. 82, Issue 5 [page]

1995 Psychological Abstracts  
The new method involves the individ- ual’s creation of a word tree about a nuclear weapons factory. 227 11th- and 12th-grade students from across the US provided word trees after viewing a videotape about  ...  The primary objective of the WAT is the rapid examination and grading of a large number of students in a number of fields and at various levels of achievement.  ... 
« Previous Showing results 1 — 15 out of 9,426 results