Relevant bibliographies by topics / Symbolic rules

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Symbolic rules'

Author: Grafiati
Published: 3 June 2025
Last updated: 13 July 2025

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

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Symbolic rules.'

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.

Journal articles on the topic "Symbolic rules"

1

Cuyt, Annie, Brahim Benouahmane, Hamsapriye, and Irem Yaman. "Symbolic–numeric Gaussian cubature rules." Applied Numerical Mathematics 61, no. 8 (2011): 929–45. http://dx.doi.org/10.1016/j.apnum.2011.03.003.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hadley, Robert F. "Connectionism, explicit rules, and symbolic manipulation." Minds and Machines 3, no. 2 (1993): 183–200. http://dx.doi.org/10.1007/bf00975531.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Kozaitis, S. P. "Higher-ordered rules for symbolic substitution." Optics Communications 65, no. 5 (1988): 339–42. http://dx.doi.org/10.1016/0030-4018(88)90098-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Cleeremans, Axel, and Arnaud Destrebecqz. "Real rules are conscious." Behavioral and Brain Sciences 28, no. 1 (2005): 19–20. http://dx.doi.org/10.1017/s0140525x05280019.

Full text
Abstract:
In general, we agree with Pothos's claim that similarity and rule knowledge are best viewed as situated on the extreme points of a single representational continuum. However, we contend that a distinction can be made between “rule-like” and “rule-based” knowledge: Rule-based, symbolic knowledge is necessarily conscious when it is applied. Awareness thus provides a useful criterion for distinguishing between sensitivity to functional similarity and knowledge of symbolic rules.
APA, Harvard, Vancouver, ISO, and other styles
5

Dancs, Michael J., and Tian-Xiao He. "-Analogues of Symbolic Operators." Journal of Discrete Mathematics 2013 (July 14, 2013): 1–6. http://dx.doi.org/10.1155/2013/487546.

Full text
Abstract:
Here presented are -extensions of several linear operators including a novel -analogue of the derivative operator . Some -analogues of the symbolic substitution rules given by He et al., 2007, are obtained. As sample applications, we show how these -substitution rules may be used to construct symbolic summation and series transformation formulas, including -analogues of the classical Euler transformations for accelerating the convergence of alternating series.
APA, Harvard, Vancouver, ISO, and other styles
6

Greenberg, Gabriel. "The Iconic-Symbolic Spectrum." Philosophical Review 132, no. 4 (2023): 579–627. http://dx.doi.org/10.1215/00318108-10697558.

Full text
Abstract:
It is common to distinguish two great families of representation. Symbolic representations include logical and mathematical symbols, words, and complex linguistic expressions. Iconic representations include dials, diagrams, maps, pictures, 3-dimensional models, and depictive gestures. This essay describes and motivates a new way of distinguishing iconic from symbolic representation. It locates the difference not in the signs themselves, nor in the contents they express, but in the semantic rules by which signs are associated with contents. The two kinds of rule have divergent forms, occupying opposite poles on a spectrum of naturalness. Symbolic rules are composed entirely of primitive juxtapositions of sign types with contents, while iconic rules determine contents entirely by uniform natural relations with sign types. This distinction is marked explicitly in the formal semantics of familiar sign systems, both for atomic first-order representations, like words, pixel colors, and dials, and for complex second-order representations, like sentences, diagrams, and pictures.
APA, Harvard, Vancouver, ISO, and other styles
7

HATZILYGEROUDIS, I., and J. PRENTZAS. "NEURULES: IMPROVING THE PERFORMANCE OF SYMBOLIC RULES." International Journal on Artificial Intelligence Tools 09, no. 01 (2000): 113–30. http://dx.doi.org/10.1142/s0218213000000094.

Full text
Abstract:
In this paper, we present a method for improving the performance of classical symbolic rules. This is achieved by introducing a type of hybrid rules, called neurules, which integrate neurocomputing into the symbolic framework of production rules. Neurules are produced by converting existing symbolic rules. Each neurule is considered as an adaline unit, where weights are considered as significance factors. Each significance factor represents the significance of the associated condition in drawing the conclusion. A rule is fired when the corresponding adaline output becomes active. This significantly reduces the size of the rule base and, due to a number of heuristics used in the inference process, increases efficiency of the inferences.
APA, Harvard, Vancouver, ISO, and other styles
8

Cheng, C. K., X. Deng, Y. Z. Liao, and S. Z. Yao. "Symbolic layout compaction under conditional design rules." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 11, no. 4 (1992): 475–86. http://dx.doi.org/10.1109/43.125095.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

S.V.S., Ganga Devi. "FUZZY RULE EXTRACTION FOR FRUIT DATA CLASSIFICATION." COMPUSOFT: An International Journal of Advanced Computer Technology 02, no. 12 (2013): 400–403. https://doi.org/10.5281/zenodo.14613549.

Full text
Abstract:
Decision Tree algorithms provide one of the most popular methodologies for symbolic knowledge acquisition. The resulting knowledge, a symbolic Decision Tree along with a simple inference mechanism, has been praised for comprehensibility. The most comprehensible Decision Trees have been designed and then rules are extracted for perfect symbolic data. Over the years, additional methodologies have been investigated and proposed to deal with continuous or multi-valued data and with missing or noisy features. Recently, with the growing popularity of fuzzy representation in Decision Trees are introduced to deal with similar situations. Fuzzy representation bridges the gap between symbolic and non-symbolic data by linking qualitative linguistic terms with quantitative data. In this paper first Fuzzy Decision Tree for Fruit data classification is constructed and then the fuzzy classification rules are extracted. 
APA, Harvard, Vancouver, ISO, and other styles
10

Fujii, Makoto, and Takeshi Furuhashi. "A Rule Discovery by Fuzzy Classifier System Utilizing Symbolic Information." Journal of Advanced Computational Intelligence and Intelligent Informatics 4, no. 1 (2000): 24–30. http://dx.doi.org/10.20965/jaciii.2000.p0024.

Full text
Abstract:
This paper presents a new fuzzy classifier system (FCS) that can discover effective fuzzy rules efficiently. The system incorporates human knowledge in the form of symbolic information, and effectively limits its search space for fuzzy rules by using knowledge. The system also extracts symbolic information from acquired fuzzy rules for efficient exploration of other new fuzzy rules. Simulations are done to demonstrate the feasibility of the proposed method.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Symbolic rules"

1

Chen, Tianye M. EngMassachusetts Institute of Technology. "Augmenting anomaly detection for autonomous vehicles with symbolic rules." Thesis, Massachusetts Institute of Technology, 2019. https://hdl.handle.net/1721.1/123013.

Full text
Abstract:
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2019<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 53-54).<br>My research investigates the issues in anomaly detection as applied to autonomous driving created by the incompleteness of training data. I address these issues through the use of a commonsense knowledge base, a predefined set of rules regarding driving behavior, and a means of updating the base set of rules as anomalies are detected. In order to explore this problem I have built a hardware platform that was used to evaluate existing anomaly detection developed within the lab and that will serve as an evaluation platform for future work in this area. The platform is based on the open-source MIT RACECAR project that integrates the most basic aspect of an driving autonomous vehicle - lidar, camera, accelerometer, and computer - onto the frame of an RC car. We created a set of rules regarding traffic light color transitions to test the car's ability to navigate cones (which represent traffic light colors) and detect anomalies in the traffic light transition order. Anomalies regularly occurred in the car's driving environment and its driving rules were updated as a consequence of the logged anomalies. The car was able to successfully navigate the course and the rules (plausible traffic light color transitions) were updated when repeated anomalies were seen.<br>by Tianye Chen.<br>M. Eng.<br>M.Eng. Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science
APA, Harvard, Vancouver, ISO, and other styles
2

Mundy, Darren Paul. "Using a symbolic algorithm to extract rules from connectionist networks." Thesis, University of Exeter, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.240400.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Loomis, Eric John. "Meaning, generality, and rules : language and logic in the later Wittgenstein /." Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Junior, José Martins. "Modelagem e aplicação de regras comportamentais em ambientes colaborativos, envolvendo agentes humanos e robóticos." Universidade de São Paulo, 2010. http://www.teses.usp.br/teses/disponiveis/18/18149/tde-07022011-135624/.

Full text
Abstract:
Historicamente, o termo robô teve sua origem associada à forma humana e também ao seu comportamento. O ser humano desenvolveu, ao longo de seu processo evolutivo, capacidades mentais superiores como a memória, a linguagem, a vontade, entre outras. Tais faculdades permitem-lhe comparar informações obtidas do ambiente e de seus semelhantes com suas recordações e deliberar ações, ou realizar comunicações por meio de linguagens simbólicas, muitas vezes ambíguas. A área da cooperação robótica concentra estudos sobre a interação entre robôs e tem apresentado soluções para o controle adaptativo que, em sua maioria, dota os agentes robóticos de capacidades reativas a estímulos do ambiente. Porém, quando a interação envolve robô e humano, nota-se que as abordagens publicadas colocam apenas o ser humano no papel deliberativo. Essa solução mostra-se limitada, principalmente quando se busca por novas formas de interação que permitam um sistema robótico colaborar efetivamente com humanos e até tutorar o aprendizado destes. Com intuito de contribuir com a solução desse problema, é proposta e apresentada uma nova abordagem de controle, baseada em arquitetura distribuída e que permite a deliberação de comportamentos cooperativos e colaborativos. Além disso, o novo modelo de arquitetura permite operar multi-agentes distribuídos e, com isso, partes distintas de um robô manipulador. Para se validar a aplicabilidade do modelo, apresenta-se o sistema Scara3D, uma interface gráfica que representa o gerador do ambiente virtual, a camada mais baixa do contexto global da arquitetura. Os testes do ambiente virtual envolveram a tele-operação do robô, e seus resultados comprovam a integração e a comunicação entre os contextos global e local da arquitetura. Para que os agentes robóticos e humanos decidam e deliberem ações durante tarefas colaborativas, eles devem compartilhar um mesmo modelo mental dos elementos envolvidos nesse ambiente. A estratégia adotada consiste da representação por meio de uma linguagem simbólica, restrita e não-ambígua, capaz de ser compreendida por humanos e interpretada por computadores. Nesse sentido, as regras do ambiente colaborativo robô-humano são então definidas e descritas nos termos da L-Forum, uma linguagem para abstração de ambientes colaborativos. Um estudo de caso que envolve a colaboração robô-humano em um jogo da velha é descrito em detalhes, assim como o projeto e o desenvolvimento do hardware e do software que o operam. Os testes realizados descrevem situações que demandam do robô a seleção e a aplicação de regras diferentes, e seus resultados validam o processo de deliberação de comportamentos pelo sistema. Conclui-se, portanto, que o uso de regras colaborativas oferece um nível extra de abstração ao sistema, e o torna mais flexível e adaptável em ambientes compartilhados por seres humanos.<br>Historically, the term robot was originally associated to the human form and also to his behavior. The human being, during its evolutionary process, has developed high level mental abilities such as memory, language, will, among others. Such features allow him to compare information obtained from the environment and from his peers with their memories and deliberate actions or communications by means of a symbolic language, often ambiguous. The research area of robotics cooperation focuses on the interaction among robots and has presented solutions for the adaptive control that, in most cases, provides the robotic agents with reactive capabilities in response to environmental stimuli. However, when the interaction involves robot and human, the approaches that are available in the literature, assign the deliberative role only to the human. This is a constrained solution, especially when looking for new interaction forms that allow a robotic system to effectively collaborate with humans and to tutor the learning of them. Aiming to contribute to the solution of this problem is proposed and presented a new control approach based on distributed architecture that allows the deliberation of cooperative and collaborative behavior. Moreover, the new architecture model allows the interoperation of distributed multi-agents, and thus, distinct parts of a robot manipulator. The presented Scara3D system is used to validate the applicability of the model. The Scara3D is a graphical interface that represents the generator of the virtual environment, the bottom most layer of the global context of architecture. The tests of virtual environment involved the robot teleoperation, and its results prove the integration and communication between local and global contexts of architecture. For the robotic agents and humans decide and deliberate actions during collaborative tasks, they must share the same mental model of the elements involved in this environment. The adopted strategy consists of representation by means of a symbolic language, restricted and non-ambiguous, understandable by humans and interpretable by computers. In this sense, the rules of human-robot collaborative environment are then defined and described in terms of L-Forum, a language that allows abstracting collaborative environments. A case study involving human-robot cooperation in a tic-tac-toe is described in detail, as well as design and development of hardware and software that operate it. The tests describe situations that require the robot selection and application of different rules, and their results validate the process of behavior deliberation by the system. Therefore it is possible to conclude that the collaborative rules usage provides an extra abstraction level to the system, and makes it more flexible and adaptive in environments shared by humans.
APA, Harvard, Vancouver, ISO, and other styles
5

Bader, Sebastian. "Neural-Symbolic Integration." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2009. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-25468.

Full text
Abstract:
In this thesis, we discuss different techniques to bridge the gap between two different approaches to artificial intelligence: the symbolic and the connectionist paradigm. Both approaches have quite contrasting advantages and disadvantages. Research in the area of neural-symbolic integration aims at bridging the gap between them. Starting from a human readable logic program, we construct connectionist systems, which behave equivalently. Afterwards, those systems can be trained, and later the refined knowledge be extracted.
APA, Harvard, Vancouver, ISO, and other styles
6

Miranda, Eduardo Silva. "Libertando o sonho da criação: um olhar psicológico sobre os jogos de interpretação de papéis (RPG)." Universidade Federal do Espírito Santo, 2005. http://repositorio.ufes.br/handle/10/6658.

Full text
Abstract:
Made available in DSpace on 2016-12-23T14:37:59Z (GMT). No. of bitstreams: 1 Dissertacao_EDUARDO_MIRANDA.pdf: 682411 bytes, checksum: 02471e1edaa7016b11b9c148dbdcc320 (MD5) Previous issue date: 2005-03-23<br>Os jogos de interpretação de papéis (RPG) têm sido alvos de críticas e apologias das mais variadas, muitas vezes sem embasamento científico. Tais jogos aparecem cada vez mais entre as práticas lúdicas de adolescentes e é crescente o número de pesquisas acerca de seu uso em educação. Assim, tornase necessária uma investigação com bases psicológicas sobre o tema. Para chegar a esse posicionamento, foram relacionados aspectos contidos na dinâmica do jogo e discurso de 22 jogadores da região da Grande Vitória, analisados sob um viés psicológico. Com base nessas informações, pôde-se traçar um panorama das características da atividade, bem como o lugar que ela ocupa nas relações que esses jogadores perfazem e suas conseqüências para esses mesmos sujeitos. Os dados foram coletados por meio de questionários e entrevistas e foram agrupados em categorias estabelecidas a posteriori. Os resultados finais caracterizam um grupo de praticantes de RPG do Estado do Espírito Santo e tornam possível a análise psicológica das particularidades detectadas. Pôde-se avaliar o lugar que a prática de jogar RPG ocupa na rotina dos participantes, bem como analisar, por meio dos dados coletados, aspectos psicológicos intrínsecos ao jogo.<br>Role Playing Games (RPG) had been constantly criticized or defended in many forms, several times without a scientific approach. These kind of games appear in the playful behaviors of many adolescents. With the increasing use of RPG on education and more researches been developed in the area, it makes necessary a psychological approach of the matter. To make this possible, this work relates the speech of some players with intrinsic aspects of the RPG dynamics. A view of the RPG characteristics could be done with these data, as well as a look on the relations that the subjects make with the game and its possible consequences. The data were grouped in categories after some questionnaires and interviews had been done. The final results show the way of being of a small group of players of Espirito Santo's state and allows a psychological analysis of the characteristics collected. It was possible to evaluate what is the place of RPG in the subjects routine, as well as specific characteristics of the game that are of special interests of Psychology.
APA, Harvard, Vancouver, ISO, and other styles
7

Heyne, Edward J. "A .Net Framework for Rule-Based Symbolic Database Visualization in 3D." University of Akron / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=akron1312664305.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Galassi, Andrea <1992&gt. "Deep Networks and Knowledge: from Rule Learning to Neural-Symbolic Argument Mining." Doctoral thesis, Alma Mater Studiorum - Università di Bologna, 2021. http://amsdottorato.unibo.it/9842/1/TESI_PHDv2.pdf.

Full text
Abstract:
Deep Learning has revolutionized the whole discipline of machine learning, heavily impacting fields such as Computer Vision, Natural Language Processing, and other domains concerned with the processing of raw inputs. Nonetheless, Deep Networks are still difficult to interpret, and their inference process is all but transparent. Moreover, there are still challenging tasks for Deep Networks: contexts where the success depends on structured knowledge that can not be easily provided to the networks in a standardized way. We aim to investigate the behavior of Deep Networks, assessing whether they are capable of learning complex concepts such as rules and constraints without explicit information, and then how to improve them by providing such symbolic knowledge in a general and modular way. We start by addressing two tasks: learning the rule of a game and learning to construct the solution to Constraint Satisfaction Problems. We provide the networks only with examples, without encoding any information regarding the task. We observe that the networks are capable of learning to play by the rules and to make feasible assignments in the CSPs. Then, we move to Argument Mining, a complex NLP task which consists of finding the argumentative elements in a document and identifying their relationships. We analyze Neural Attention, a mechanism widely used in NLP to improve networks' performance and interpretability, providing a taxonomy of its implementations. We exploit such a method to train an ensemble of deep residual networks and test them on four different corpora for Argument Mining, reaching or advancing the state of the art in most of the datasets we considered for this study. Finally, we realize the first implementation of neural-symbolic argument mining. We use the Logic Tensor Networks framework to introduce logic rules during the training process and establish that they give a positive contribution under multiple dimensions.
APA, Harvard, Vancouver, ISO, and other styles
9

Masmoudi, Dammak Abir. "Approche hybride pour la reconnaissance automatique de la parole en langue arabe." Thesis, Le Mans, 2016. http://www.theses.fr/2016LEMA1040/document.

Full text
Abstract:
Le développement d'un système de reconnaissance de la parole exige la disponibilité d'une grande quantité de ressources à savoir, grands corpus de texte et de parole, un dictionnaire de prononciation. Néanmoins, ces ressources ne sont pas disponibles directement pour des dialectes arabes. De ce fait, le développement d'un SRAP pour les dialectes arabes se heurte à de multiples difficultés à savoir, l’'abence de grandes quantités de ressources et l'absence d’'une orthographe standard vu que ces dialectes sont parlés et non écrit. Dans cette perspective, les travaux de cette thèse s’intègrent dans le cadre du développement d’un SRAP pour le dialecte tunisien. Une première partie des contributions consiste à développer une variante de CODA (Conventional Orthography for Arabic Dialectal) pour le dialecte tunisien. En fait, cette convention est conçue dans le but de fournir une description détaillée des directives appliquées au dialecte tunisien. Compte tenu des lignes directives de CODA, nous avons constitué notre corpus nommé TARIC : Corpus de l’interaction des chemins de fer de l’arabe tunisien dans le domaine de la SNCFT. Outre ces ressources, le dictionnaire de prononciation s’impose d’une manière indispensable pour le développement d’un SRAP. À ce propos, dans la deuxième partie des contributions, nous visons la création d’un système nommé conversion (Graphème-Phonème) G2P qui permet de générer automatiquement ce dictionnaire phonétique. Toutes ces ressources décrites avant sont utilisées pour adapter un SRAP pour le MSA du laboratoire LIUM au dialecte tunisien dans le domaine de la SNCFT. L’évaluation de notre système donné lieu WER de 22,6% sur l’ensemble de test<br>The development of a speech recognition system requires the availability of a large amount of resources namely, large corpora of text and speech, a dictionary of pronunciation. Nevertheless, these resources are not available directly for Arabic dialects. As a result, the development of a SRAP for Arabic dialects is fraught with many difficulties, namely the lack of large amounts of resources and the absence of a standard spelling as these dialects are spoken and not written. In this perspective, the work of this thesis is part of the development of a SRAP for the Tunisian dialect. A first part of the contributions consists in developing a variant of CODA (Conventional Orthography for Arabic Dialectal) for the Tunisian dialect. In fact, this convention is designed to provide a detailed description of the guidelines applied to the Tunisian dialect. Given the guidelines of CODA, we have created our corpus TARIC: Corpus of the interaction of the railways of the Tunisian Arab in the field of SNCFT. In addition to these resources, the pronunciation dictionary is indispensable for the development of a peech recognition system. In this regard, in the second part of the contributions, we aim at the creation of a system called conversion(Grapheme-Phonème) G2P which allows to automatically generate this phonetic dictionary. All these resources described before are used to adapt a SRAP for the MSA of the LIUM laboratory to the Tunisian dialect in the field of SNCFT. The evaluation of our system gave rise to WER of 22.6% on the test set
APA, Harvard, Vancouver, ISO, and other styles
10

Hassani, Sarah Dossey John A. "Calculus students' knowledge of the composition of functions and the chain rule." Normal, Ill. Illinois State University, 1998. http://wwwlib.umi.com/cr/ilstu/fullcit?p9835906.

Full text
Abstract:
Thesis (D.A.)--Illinois State University, 1998.<br>Title from title page screen, viewed July 3, 2006. Dissertation Committee: John A. Dossey (chair), Roger Day, Michael Marsali, Michael Plantholt. Includes bibliographical references (leaves 196-202) and abstract. Also available in print.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Symbolic rules"

1

Apolloni, Bruno. From Synapses to Rules: Discovering Symbolic Rules from Neural Processed Data. Springer US, 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

International School on Neural Nets "E.R. Caianiello" Fifth Course: From Synapses to Rules: Discovering Symbolic Rules From Neural Processed Data (2002 Erice, Italy). From synapses to rules: Discovering symbolic rules from neural processed data. Kluwer Academic/Plenum Pub., 2002.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ruan, Da. Fuzzy If-Then Rules in Computational Intelligence: Theory and Applications. Springer US, 2000.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Descartes, René. Regulae ad directionem ingenii =: Rules for the direction of the natural intelligence : a bilingual edition of the Cartesian treatise on method. Rodopi, 1998.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Roux, Jean-Paul. Le roi: Mythes et symboles. Fayard, 1995.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Heckel, J. S. A methodology for linking symbolic and graphical models for collaborative engineering. US Army Corps of Engineers, Construction Engineering Research Laboratories, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Nicolle, Zeegers, Witteveen W. J, and Klink Bart van, eds. Social and symbolic efforts of legislation under the rule of law. Edwin Mellen Press, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

Althoff, Gerd. Die Macht der Rituale: Symbolik und Herrschaft im Mittelalter. Primus, 2003.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

New Zealand. Parliament. House of Representatives. Complaint regarding Land Transport Rule: Vehicle Equipment 2004 (Rule 32017): Report of the Regulations Review Committee. New Zealand House of Representatives, 2005.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Bhutan. Election symbols rules of the Kingdom of Bhutan =: ʼBrug gi btsag thuʼi ṅo rtags bcaʼ yig. Election Commission of Bhutan, 2007.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Symbolic rules"

1

Himmelhuber, Anna, Stephan Grimm, Sonja Zillner, Mitchell Joblin, Martin Ringsquandl, and Thomas Runkler. "Combining Sub-symbolic and Symbolic Methods for Explainability." In Rules and Reasoning. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-91167-6_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Bianchi, Federico, Matteo Palmonari, Pascal Hitzler, and Luciano Serafini. "Complementing Logical Reasoning with Sub-symbolic Commonsense." In Rules and Reasoning. Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-31095-0_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Bahamonde, Antonio, Enrique A. de la Cal, José Ranilla, and Jaime Alonso. "Self-organizing symbolic learned rules." In Biological and Artificial Computation: From Neuroscience to Technology. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/bfb0032513.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Moreno, Ginés, and José A. Riaza. "Symbolic Similarity Relations for Tuning Fully Integrated Fuzzy Logic Programs." In Rules and Reasoning. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-57977-7_11.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Bologna, Guido. "Determining Hyper-planes to Generate Symbolic Rules." In Connectionist Models of Neurons, Learning Processes, and Artificial Intelligence. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/3-540-45720-8_95.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Kurfess, Franz J. "Integrating Symbol-Oriented and Sub-Symbolic Reasoning Methods into Hybrid Systems." In From Synapses to Rules. Springer US, 2002. http://dx.doi.org/10.1007/978-1-4615-0705-5_14.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Purohit, Disha, and Maria-Esther Vidal. "Mining Symbolic Rules to Explain Lung Cancer Treatments." In Lecture Notes in Computer Science. Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-43458-7_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Jin, Xiaoqing, Yousra Lembachar, and Gianfranco Ciardo. "Symbolic Termination and Confluence Checking for ECA Rules." In Lecture Notes in Computer Science. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-45730-6_6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Kreimer, Dirk. "Outer Space as a Combinatorial Backbone for Cutkosky Rules and Coactions." In Texts & Monographs in Symbolic Computation. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-80219-6_12.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kaneda, Shigeo, Hussein Almuallim, Yasuhiro Akiba, Megumi Ishii, and Tsukasa Kawaoka. "A revision learner to acquire verb selection rules from human-made rules and examples." In Connectionist, Statistical and Symbolic Approaches to Learning for Natural Language Processing. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-60925-3_65.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Symbolic rules"

1

Mafteiu-Scai, Roxana-Teodora. "Learning Dispatching Rules for Flexible Assembly Scheduling Problems Using Deep Reinforcement Learning." In 2024 26th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2024. https://doi.org/10.1109/synasc65383.2024.00067.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sharma, Siddhant, Shreshth Tuli, and Rohan Paul. "Unsupervised Learning of Neuro-symbolic Rules for Generalizable Context-aware Planning in Object Arrangement Tasks." In 2024 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2024. http://dx.doi.org/10.1109/icra57147.2024.10610696.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mitterer, Felix, Christian Burmer, and Konstantin Schekotihin. "Automating Routing of Product Returns for Failure Analysis with Neuro-Symbolic AI." In ISTFA 2024. ASM International, 2024. http://dx.doi.org/10.31399/asm.cp.istfa2024p0047.

Full text
Abstract:
Abstract Before failure analysis (FA) can start, a product must get from the customer to the correct location, which is not always trivial, especially in larger companies with many FA labs. Automating and optimizing this routing, therefore reducing manual labor, misrouting, and turnaround time, requires the development of problem-solving methods utilizing both explicit and implicit knowledge. The first type refers to known routing rules, e.g., based on lab equipment or certifications, whereas the second type must be induced from available data, e.g., by analyzing customer descriptions using machine learning (ML) methods. Therefore, to solve the routing problem, we suggest a neurosymbolic integration of natural language processing methods into the symbolic context of a logic-based solver. The conducted evaluation shows that the suggested method can reduce the reships by appr. 33% while ensuring the fulfillment of all shipment constraints.
APA, Harvard, Vancouver, ISO, and other styles
4

Daniele, Alessandro, Tommaso Campari, Sagar Malhotra, and Luciano Serafini. "Deep Symbolic Learning: Discovering Symbols and Rules from Perceptions." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/400.

Full text
Abstract:
Neuro-Symbolic (NeSy) integration combines symbolic reasoning with Neural Networks (NNs) for tasks requiring perception and reasoning. Most NeSy systems rely on continuous relaxation of logical knowledge, and no discrete decisions are made within the model pipeline. Furthermore, these methods assume that the symbolic rules are given. In this paper, we propose Deep Symboilic Learning (DSL), a NeSy system that learns NeSy-functions, i.e., the composition of a (set of) perception functions which map continuous data to discrete symbols, and a symbolic function over the set of symbols. DSL simultaneously learns the perception and symbolic functions while being trained only on their composition (NeSy-function). The key novelty of DSL is that it can create internal (interpretable) symbolic representations and map them to perception inputs within a differentiable NN learning pipeline. The created symbols are automatically selected to generate symbolic functions that best explain the data. We provide experimental analysis to substantiate the efficacy of DSL in simultaneously learning perception and symbolic functions.
APA, Harvard, Vancouver, ISO, and other styles
5

Cui, Heming, Gang Hu, Jingyue Wu, and Junfeng Yang. "Verifying systems rules using rule-directed symbolic execution." In the eighteenth international conference. ACM Press, 2013. http://dx.doi.org/10.1145/2451116.2451152.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

HATZILYGEROUDIS, I., and J. PRENTZAS. "NEURULES: INTEGRATING SYMBOLIC RULES AND NEUROCOMPUTING." In Proceedings of the 7th Hellenic Conference on Informatics (HCI '99). WORLD SCIENTIFIC, 2000. http://dx.doi.org/10.1142/9789812793928_0011.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Jabbour, Said, Badran Raddaoui, and Lakhdar Sais. "A Symbolic Approach to Computing Disjunctive Association Rules from Data." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/237.

Full text
Abstract:
Association rule mining is one of the well-studied and most important knowledge discovery task in data mining. In this paper, we first introduce the k-disjunctive support based itemset, a generalization of the traditional model of itemset by allowing the absence of up to k items in each transaction matching the itemset. Then, to discover more expressive rules from data, we define the concept of (k, k′)-disjunctive support based association rules by considering the antecedent and the consequent of the rule as k-disjunctive and k′-disjunctive support based itemsets, respectively. Second, we provide a polynomial-time reduction of both the problems of mining k-disjunctive support based itemsets and (k, k′)-disjunctive support based association rules to the propositional satisfiability model enumeration task. Finally, we show through an extensive campaign of experiments on several popular real-life datasets the efficiency of our proposed approach
APA, Harvard, Vancouver, ISO, and other styles
8

Hatzilygeroudis, I., and J. Prentzas. "Controlling the Production of Neuro-symbolic Rules." In 2012 IEEE 24th International Conference on Tools with Artificial Intelligence (ICTAI 2012). IEEE, 2012. http://dx.doi.org/10.1109/ictai.2012.148.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Villanueva, J., V. Cruz, G. Reyes, and A. Benitez. "Extracting Refined Rules from Hybrid Neuro-Symbolic Systems." In 2006 International Joint Conference on Neural Networks. IEEE, 2006. http://dx.doi.org/10.1109/ijcnn.2006.247260.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Johnson, John L. "Symbolic substitution and patterns." In OSA Annual Meeting. Optica Publishing Group, 1987. http://dx.doi.org/10.1364/oam.1987.tuw5.

Full text
Abstract:
The interrelationships among symbolic substitution, neural nets, optical correlators, the permutation group S N , and digital computers are discussed. An example is given showing how these apply to the design of a full binary adder. Arithmetic rules are transformed into two pattern replacement rules which are implemented by neural networks. These are combined to form the N-bit adder. A functionally equivalent system design using optical correlation techniques is discussed. The group aspect is discussed. Since every group is isomorphic to a subgroup of S N the interrelationships imply access to a powerful mathematical base for optical nets. A binary Grossberg model leads to a characterization of S N in terms of the number of nodes and input connections.
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Symbolic rules"

1

Decleir, Cyril, Mohand-Saïd Hacid, and Jacques Kouloumdjian. A Database Approach for Modeling and Querying Video Data. Aachen University of Technology, 1999. http://dx.doi.org/10.25368/2022.90.

Full text
Abstract:
Indexing video data is essential for providing content based access. In this paper, we consider how database technology can offer an integrated framework for modeling and querying video data. As many concerns in video (e.g., modeling and querying) are also found in databases, databases provide an interesting angle to attack many of the problems. From a video applications perspective, database systems provide a nice basis for future video systems. More generally, database research will provide solutions to many video issues even if these are partial or fragmented. From a database perspective, video applications provide beautiful challenges. Next generation database systems will need to provide support for multimedia data (e.g., image, video, audio). These data types require new techniques for their management (i.e., storing, modeling, querying, etc.). Hence new solutions are significant. This paper develops a data model and a rule-based query language for video content based indexing and retrieval. The data model is designed around the object and constraint paradigms. A video sequence is split into a set of fragments. Each fragment can be analyzed to extract the information (symbolic descriptions) of interest that can be put into a database. This database can then be searched to find information of interest. Two types of information are considered: (1) the entities (objects) of interest in the domain of a video sequence, (2) video frames which contain these entities. To represent these information, our data model allows facts as well as objects and constraints. We present a declarative, rule-based, constraint query language that can be used to infer relationships about information represented in the model. The language has a clear declarative and operational semantics. This work is a major revision and a consolidation of [12, 13].
APA, Harvard, Vancouver, ISO, and other styles
2

Socially significant technologies in working with children with special educational needs. Science and Innovation Center Publishing House, 2024. http://dx.doi.org/10.12731/er0829.05112024.

Full text
Abstract:
The methodological recommendations consider the issues of introducing socially significant technologies in inclusive education. The methodological recommendations are intended for educators, teachers of preschool educational institutions implementing the federal educational program of preschool education. They can be used in working with preschool children in preschool educational institutions and institutions of additional education. Inclusive education is an important trend in the modern educational policy of Russia. This model involves creating conditions for the education of all children, regardless of their physical, intellectual, social, emotional or other characteristics. In accordance with the Federal State Educational Standard of the Russian Federation and the Federal Educational Standard, the construction of the educational process requires the creation of conditions for independent active activity of children, during which the child learns the norms, rules of society, methods of obtaining knowledge, the main elements of culture (symbols, values, meanings). L.S. Vygotsky wrote that through communication, joint activities (primarily joint work) and social cognition, the child's external activity turns into internal mental activity, external requirements become internal self-limitations, and motives, means and goals of activity are produced, chosen by the subject himself, and not set by others. And only when internalized, turned inside the consciousness of the individual, knowledge, norms, modes of behavior and activity can be externalized (presented to other people, included in joint activities with them). Pedagogical technologies are a key tool for creating an inclusive educational environment, where every child, regardless of his abilities and characteristics, can realize his potential. In a modern preschool institution, various forms of work are used to develop social knowledge and skills, organized and conducted by a teacher. Education for children with disabilities is of particular social significance, as it contributes to their integration into society, the development of social skills and ensuring equal opportunities. The importance of using specialized pedagogical technologies is justified by the need to adapt the educational process to the individual needs of each child. Positive socialization, development of social competencies will be more effective if such technologies are used in pedagogical practice that would allow preschoolers to realize their own plans, develop independence and initiative. This is no less relevant for children with disabilities and even, most likely, more relevant. Very often, children with disabilities have low self-esteem, lack of confidence in their abilities, and lack of fulfillment in various types of activities typical of preschool age. The purpose of the work is to summarize and present the experience of recent years in the use of socially significant technologies in the practice of working with children with disabilities.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Symbolic rules' for particular source types:
Journal articles Dissertations / Theses Books
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!

To the bibliography