46,931 Hits in 4.5 sec

Token Evolution in an Ill-posed Constraint Petri-net

Hideaki Suzuki, Yoh Iwasa
2015 Proceedings of the 8th International Conference on Bio-inspired Information and Communications Technologies (formerly BIONETICS)  
Unification constraints of predicate logic or string rewriting rules of context free grammar can be represented by a Petri-net with the AND/OR tree structure.  ...  The paper focuses on a token-based heuristic method to solve such an ill-posed problem, and presents three prerequisite conditions to be satisfied by tokens which propagate and evolve in the network.  ...  CONCLUSION Using the constraint Petri-nets that represent such declarative knowledge as predicate logic or generative grammar, deductive inference or parsing on context free grammar can be formulated as  ... 
doi:10.4108/icst.bict.2014.257936 dblp:conf/bionetics/SuzukiI14 fatcat:4ypwny3yrrbspkgzpjuz5v7dii

Cumulative subject index volumes 68–71

1986 Information and Control  
analysis, 68, 105 for computing properties and functions of n-node forest stored in processor mesh, 69, 168 deterministic, applications to optimal parallel list ranking, 70, 32 network resource allocation  ...  Aggregation problems, formulation of several versions, analysis from recursion theoretic point of view, 70, 69 Algorithms for circular retrieval and k-nearest neighbor search problems, description and  ...  , 68, 196 Emulations, see also Simulations cube, ring, shuffle-exchange, and two- dimensional grid networks, 71, 143 Equivalence syntactic, establishment between categor- ical combinatory logic and  ... 
doi:10.1016/s0019-9958(86)80014-6 fatcat:hkligygazvcyvdgrhtvhrefpj4

Verification of Infinite State Systems [chapter]

Ahmed Bouajjani
2003 Lecture Notes in Computer Science  
In the last two years the specification and verification of infinite-state systems have attracted the attention of more and more researchers belonging to a very broad range of research communities.  ...  reasoning about families of systems, e.g., networks of processes, • process mobility, dynamic creation and destruction of processes (dynamic modification of the communication structure).  ...  In the talk we also discussed some connections to mu-calculus based model-checking of context-free and push-down processes [1, 2, 9] and to propositional dynamic logics with context-free programs [3  ... 
doi:10.1007/978-3-540-45220-1_7 fatcat:4j5lzdbfc5hd7ptdo4tpwvmd2m

Symbolic Logic meets Machine Learning: A Brief Survey in Infinite Domains [article]

Vaishak Belle
2020 arXiv   pre-print
We report on results that challenge this view on the limitations of logic, and expose the role that logic can play for learning in infinite domains.  ...  Our narrative is structured in terms of three strands: logic versus learning, machine learning for logic, and logic for machine learning, but naturally, there is considerable overlap.  ...  and hard, deterministic constraints?  ... 
arXiv:2006.08480v1 fatcat:d23e4d6kcfbtjduztfr6y4536a

Page 1658 of Mathematical Reviews Vol. , Issue 82d [page]

1982 Mathematical Reviews  
respect to the criterion of minimum adjusted expenditures for creation and operation of the remote data processing network (RDPN) with a constraint on the mean response time to a user request.  ...  of schemes; we describe a standardized form of logic schemes and their equivalent transformations.”  ... 

Dynamic contracts for distributed temporal logic control of traffic networks

Eric S. Kim, Sadra Sadraddini, Calin Belta, Murat Arcak, Sanjit A. Seshia
2017 2017 IEEE 56th Annual Conference on Decision and Control (CDC)  
A case study on a mixed urban-freeway network is presented, where the objective is infinite-time congestion avoidance and temporal requirements on the traffic lights in the urban intersections.  ...  We propose a framework for using dynamic contracts for controlling traffic networks from temporal logic specifications.  ...  Both the network dynamics and MTL specification φ i can be encoded as mixed integer constraints.  ... 
doi:10.1109/cdc.2017.8264194 dblp:conf/cdc/KimSBAS17 fatcat:krsgsqwdjreqzmqqixbqcbo4pq

Wave-function parametrization in Field Theory and Machine Learning [article]

Leonardo Pedro
2022 Zenodo  
This renders Bayesian inference as a general and theoretically grounded framework for Machine Learning.  ...  The wave-function parametrization is so important because it allows us to define mathematically a general probability measure for an infinite number of random variables.  ...  Therefore, neural networks follow the Bayesian updating rule (which is derived from basic logic principles) only approximately and in an unpredictable way.  ... 
doi:10.5281/zenodo.5896886 fatcat:7iv2kvb46rfwnnnir26afu7g54

Using Extended Logic Programming for Alarm-Correlation in Cellular Phone Networks [chapter]

Peter Fröhlich, Wolfgang Nejdl, Michael Schroeder, Carlos Damásio, Luis Moniz Pereira
1999 Lecture Notes in Computer Science  
In this paper, we describe how to realise alarm-correlation in cellular phone networks using extended logic programming which provides integrity constraints, implicit and explicit negation.  ...  The BSC provides the radio resource management, which serves the control and selection of appropriate radio channels to interconnect the MS and the switched network.  ...  First we introduce extended logic programs and diagnosis, then we show how to model cellular phone networks and alarmcorrelation as extended logic programs, and finally we show how the alarm-correlation  ... 
doi:10.1007/978-3-540-48765-4_38 fatcat:cqzvbgxswff7dir6cqcpmmoofi

Page 536 of The Journal of the Operational Research Society Vol. 59, Issue 4 [page]

2008 The Journal of the Operational Research Society  
A local optimization algorithm for logical topology design and traffic grooming in IP over WDM Networks.  ...  Leonardi E, Mellia M and Marsan MA (2000). Algorithms for the logical topology design in WDM all-optical networks. Opt Network Mag 1: 35—46.  ... 

A logical denotational semantics for constraint logic programming [chapter]

Alessandra Pierro, Catuscia Palamidessi
1994 Lecture Notes in Computer Science  
The process interpretation of constraint logic programming (clp) leads to a model which is similar for many aspects to (an unsynchronized version of) concurrent constraint programming (ccp).  ...  We develop a denotational, fully abstract semantics for clp with respect to successful, failed and infinite observables.  ...  , the bottom element true the empty constraint, and the lub operation U the join of constraint, corresponding to the logical and.  ... 
doi:10.1007/3-540-57880-3_13 fatcat:pdpthhdr3bhe3g4nvjzbncwx5y

Page 2064 of Mathematical Reviews Vol. , Issue 2003C [page]

2003 Mathematical Reviews  
We present symbolic procedures, and corresponding termination criteria, for the solution of infinite-state games, which occur in the control and modular verification of infinite-state systems.  ...  Hoare logic formalizes reasoning about such dy- namic networks on an abstraction level that is at least as high as that of the programming language.  ... 

A Tableau Algorithm for Description Logics with Concrete Domains and GCIs [chapter]

Carsten Lutz, Maja Miličić
2005 Lecture Notes in Computer Science  
In description logics (DLs), concrete domains are used for defining concepts based on concrete qualities of their instances such as the weight, age, duration, and spatial extension.  ...  Then, we present a tableau algorithm for reasoning in DLs equipped with concrete domains and GCIs.  ...  A Rel-network is a (finite or infinite) set of Rel-constraints. Let N be a Rel-network.  ... 
doi:10.1007/11554554_16 fatcat:ism2jhd7lvcyfcohfw4mucy2gq

Online Monitoring of Metric Temporal Logic using Sequential Networks [article]

Dogan Ulus
2019 arXiv   pre-print
Metric Temporal Logic (MTL) is a popular formalism to specify patterns with timing constraints over the behavior of cyber-physical systems.  ...  I first explain the sequential network construction over discrete time behaviors and then extend it towards dense time by adopting a point-free approach.  ...  I am indebted to him for many enlightening discussions and suggestions over the years of my doctoral studies.  ... 
arXiv:1901.00175v1 fatcat:dnnr7colezfmdpea45j4kp2x44

Inductive Logic Programming: Challenges

Katsumi Inoue, Hayato Ohwada, Akihiro Yamamoto
An overview of notable ILP areas, focusing on three invited talks at ILP 2015, two best student papers and the panel discussion on "ILP 25 Years".  ...  PRISM and other PLP languages are powerful enough to deal with recursively defined infinite models such as Markov chains with infinitely many transitions and probabilistic context free grammars with infinitely  ...  For example, both learning logics and learning proofs and strategies (Ho et al. 2015; Farquhar et al. 2015) perform meta-logical learning.  ... 
doi:10.1609/aaai.v30i1.9874 fatcat:7auhoufzsvh5digzaz7uzqcnmq

Page 2546 of Mathematical Reviews Vol. , Issue 98D [page]

1998 Mathematical Reviews  
Wiktor Marek, Anil Nerode and Jeffrey B. Remmel, On logical constraints in logic programming (43-56); D. Aquilino, P. Asirelli, C. Renso and F.  ...  and Sheng Yu, Nondeterminism degrees for context-free languages (154-165); Ina Schiering and Wolfgang Thomas, Counter-free automata, first-order logic, and star-free expressions extended by prefix oracles  ... 
« Previous Showing results 1 — 15 out of 46,931 results