Author: Alexander Borgida

Publication Overview

Publication period start: 2010
Number of co-authors: 6

Co-Authors

Number of publications with favourite co-authors

Productive Colleagues

Most productive colleagues in number of publications

Publications

Borgida, Alexander, Greenspan, Sol J., Mylopoulos, John (1985): Knowledge Representation as the Basis for Requirements Specifications. In IEEE Computer, 18 (4) pp. 82-91.
Borgida, Alexander (1994): On The Relationship Between Description Logic and Predicate Logic. In: Proceedings of the Third International Conference on Information and Knowledge Management CIKM94 November 29 - December 2, 1994, Gaithersburg, Maryland. pp. 219-225. https://doi.acm.org/10.1145/191246.191283
Jiang, Lei, Topaloglou, Thodoros, Borgida, Alexander, Mylopoulos, John (2007): Goal-Oriented Conceptual Database Design. In: 15th IEEE International Requirements Engineering Conference RE 2007 October 15-19th, 2007, New Delhi, India. pp. 195-204. https://dx.doi.org/10.1109/RE.2007.32
Jiang, Lei, Topaloglou, Thodoros, Borgida, Alexander, Mylopoulos, John (2006): Incorporating Goal Analysis in Database Design: A Case Study from Biological Data Manageme. In: 14th IEEE International Conference on Requirements Engineering RE 2006 11-15 September, 2006, Minneapolis/St.Paul, Minnesota, USA. pp. 196-204. https://doi.ieeecomputersociety.org/10.1109/RE.2006.33
Jureta, Ivan, Borgida, Alexander, Ernst, Neil A., Mylopoulos, John (2010): Techne: Towards a New Generation of Requirements Modeling Languages with Goals, Preference. In: RE 2010, 18th IEEE International Requirements Engineering Conference, Sydney, New South Wales, Australia, September 27 - October 1, 2010 , 2010, . pp. 115-124. https://dx.doi.org/10.1109/RE.2010.24
Privacy Settings
By using this site, you accept our Cookie Policy and Terms of Use.
Customize
Accept all

Feel Stuck? Want Freedom?

Join 326,434+ designers who get one powerful email each week. Learn to design a life you love.

Next email in
7
days
7
hrs
57
mins
53
secs

Free forever. No spam. Unsubscribe anytime.