Results 81 to 90 of about 14,474 (287)
An approach for design pattern detection based on the formal context-free grammar relation driver
Aiming at the false negative problem and the overlap problem in pattern instance detection,in order to improve the accuracy of the design pattern recovery,this article introduces an approach for design pattern detection based on the formal context-free ...
XIAO Zhuo-yu+4 more
doaj +1 more source
Sustainability Performance and Its Impact on Financial Distress Risk—Evidence From STOXX Europe 600
ABSTRACT Sustainability performance (SP) has emerged as a central topic on both corporate and political agendas worldwide. This study investigated the relationship between SP and financial distress risk (FDR) among European listed firms, addressing the growing importance of SP in financial decision‐making.
Marcel Seefloth+4 more
wiley +1 more source
Using Earley Parser for Verification of Totally Ordered Hierarchical Plans
Hierarchical planning extends classical planning by capturing the hierarchical structure of tasks via decomposition of tasks to subtasks. Hierarchical plan verification is the problem of determining whether a given plan is valid according to that ...
Kristýna Pantůčková+2 more
doaj +1 more source
Abstract families of context-free grammars
An abstract family of grammars (AFG) may be defined as a class of grammars for which the corresponding class of languages forms an abstract family of languages (AFL) as defined by Ginsburg and Greibach. The derivation bounded grammars of Ginsburg and Spanier is an example of an AFG which is properly included in the class of all context-free grammars ...
openaire +4 more sources
Using AI in My Disputes? Clients' Perception and Acceptance of Using AI in Mediation
ABSTRACT This study explores how potential mediation clients perceive and accept mediators using AI in their disputes through the Unified Theory of Acceptance and Use of Technology (UTAUT). Based on 12 semi‐structured interviews, this research identifies three critical factors influencing participants' acceptance: (1) the specific tasks and processes ...
Yeju Choi
wiley +1 more source
The Smallest Grammar Problem as Constituents Choice and Minimal Grammar Parsing
The smallest grammar problem—namely, finding a smallest context-free grammar that generates exactly one sequence—is of practical and theoretical importance in fields such as Kolmogorov complexity, data compression and pattern discovery.
Gabriel Infante-Lopez+3 more
doaj +1 more source
Program equivalence and context-free grammars
Tree equivalence is a relation among polyadic recursion schemes. This relation is broad enough to be interesting: equivalent schemes may not be obviously equivalent and may still differ in computationally important ways. We show that this relation is also narrow enough to imply input-output equivalence.Is tree equivalence decidable?
openaire +3 more sources
Concurrent Context-Free Grammars [PDF]
In this paper we study some properties of context-free concurrent grammars which are controlled by Petri nets under parallel firing strategies, i.e., the transitions of a Petri net fire simultaneously in different modes. These variants of control increase the computational power of generative devices.
Mohamed Othman+3 more
openaire +2 more sources
ABSTRACT The ongoing debate in corporate sustainability (CS) about the moral case versus the business case has recently made its way into the circular economy (CE) discourse, bringing with it new tradeoffs. Although the business case perspective emphasizes profitability, critics argue that the moral case must go beyond profit motives and include ...
Felix Carl Schultz+2 more
wiley +1 more source
О существовании порождающей КС-грамматики для произвольной линейной диофантовой системы [PDF]
В работе доказывается существование контекстно-свободной грамматики и терминальной цепочки, порождающих произвольно заданную систему линейных диофантовых уравнений (ЛДУ).In this paper we prove the existance of a context-free grammar and a terminal string,
Корзун Д. Ж.
doaj