Access the full text.
Sign up today, get DeepDyve free for 14 days.
E Roanes-Lozano, E Roanes-Macías, LM Laita (2000)
Railway interlocking systems and Gröbner basesMath. Comput. Simul., 51
KM Hansen (1994)
Nordic Seminar on Dependable Computing Systems, Department of Computer Science
L Hlavaty̌, L Přeučil, PŠ Štěpán (2002)
Intelligent Methods for Quality Improvement in Industrial Practice, vol. 1
E Roanes-Lozano, LM Laita, E Roanes-Macías (1998)
A polynomial model for multivalued logics with a touch of algebraic geometry and computer algebraMath. Comput. Simul., 45
E Roanes-Lozano, LM Laita, A Hernando, E Roanes-Macías (2010)
An algebraic approach to rule based expert systemsRACSAM, 104
M Davis, G Logemann, D Loveland (1962)
A machine program for theorem-provingCommun. ACM, 5
J Hsiang (1985)
Refutational theorem proving using term-rewriting systemsArtif. Intell., 25
M Lourdes-Jiménez, JM Santamaría, R Barchino, L Laita, LM Laita, LA González, A Asenjo (2008)
Knowledge representation for diagnosis of care problems through an expert system: model of the auto-care deficit situationsExpert Syst. Appl., 34
E Roanes-Lozano, LM Laita, E Roanes-Macías (1995)
Maple V in A.I.: The Boolean algebra associated to a KBSCAN Nieuwsbrief, 14
C Rodríguez-Solano, LM Laita, E Roanes-Lozano, L López-Corral, L Laita (2006)
A computational system for diagnosis of depressive situationsExpert Syst. Appl., 31
C Pérez-Carretero, LM Laita, E Roanes-Lozano, L Lázaro, J González-Cajal, L Laita (2002)
A logic and computer algebra-based expert system for diagnosis of anorexiaMath. Comput. Simul., 58
B Buchberger (2006)
Bruno Buchberger’s PhD thesis 1965: an algorithm for finding the basis elementals of the residue class ring of a zero dimensional polynomial idealJ. Symbol. Comput., 41
D Cox, J Little, D O’Shea (1992)
Ideals, Varieties and Algorithms
K Winter, W Johnston, P Robinson, P Strooper, L Berg (2006)
Proceedings of the 10th Australian Workshop on Safety Related Programmable Systems
E-L Roanes, LM Laita (1998)
An applicable topology-independent model for railway interlocking systemsMath. Comput. Simul., 45
JC Faugère (1999)
A new efficient algorithm for computing Gröbner basesJ. Pure Appl. Algebra, 139
LM Laita, E Roanes-Lozano, V Maojo, L Ledesma, L Laita (2000)
An expert system for managing medical appropriateness criteria based on computer algebra techniquesComput. Math. Appl., 51
A Borälv (1998)
Case study: formal verification of a computerized railway interlockingForm. Asp. Comput., 10
M Brickenstein, A DreyerPolyBoRi (2009)
Polybori: a framework for Gröbner-basis computations with Boolean polynomialsJ. Symbol. Comput., 44
A Janota (2000)
Using Z Specification for Railway Interlocking SafetyPeriod. Polytech. Ser. Transp. Eng., 28
The safety of a railway network is a very important issue considered very labour-intensive. Authors have developed different approaches in order to detect automatically the safety for mid-small railway networks. Although these approaches are very simple to implement, they have the drawback of being unsuitable to large networks since the algorithm takes large time to be run. In this paper, we show a new algebraic model which, besides being also simple to implement, has the advantage of being very fast and consequently can be used for checking the safety in a large railway network.
Annals of Mathematics and Artificial Intelligence – Springer Journals
Published: Oct 13, 2012
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.