Andrzej Szalas
Andrzej Szalas
Institute of Informatics, University of Warsaw
Dirección de correo verificada de
Citado por
Citado por
Computing circumscription revisited: A reduction algorithm
P Doherty, W Łukaszewicz, A Szałas
Journal of Automated Reasoning 18 (3), 297-336, 1997
Knowledge representation techniques: a rough set approach
P Doherty, W Lukaszewicz, A Szalas
Springer, 2007
Second Order Quantifier Elimination: Foundations, Computational Aspects and Applications
DM Gabbay, R Schmidt, A Szalas
College Publications, 2008
On the correspondence between modal and classical logic: an automated approach
A Szalas
Journal of Logic And Computation 6 (3), 605-620, 1993
A fixpoint approach to second-order quantifier elimination with applications to correspondence theory
A Nonnengart, A Szalas
Logic at Work: Essays Dedicated to the Memory of Helena Rasiowa 24, 1999
Incompleteness of first-order temporal logic with until
A Szalas, L Holenderski
Theoretical Computer Science 57 (2-3), 317-325, 1988
Concerning the semantic consequence relation in first-order temporal logic
A Szalas
Theoretical Computer Science 47, 329-334, 1986
Living with inconsistency and taming nonmonotonicity
J Małuszyński, A Szałas
International Datalog 2.0 Workshop, 384-398, 2010
Time & Logic: a computational approach
L Bolc, A Szałas
Routledge, 2019
A complete axiomatic characterization of first-order temporal logic of linear time
A Szalas
Theoretical Computer Science 54 (2-3), 199-214, 1987
Efficient reasoning using the local closed-world assumption
P Doherty, W Lukaszewicz, A Szalas
International Conference on Artificial Intelligence: Methodology, Systems …, 2000
Modeling and reasoning with paraconsistent rough sets
A Vitória, J Małuszyński, A Szałas
Fundamenta Informaticae 97 (4), 405-438, 2009
Computing strongest necessary and weakest sufficient conditions of first-order formulas
P Doherty, W Lukaszewicz, A Szalas
IJCAI, 145-154, 2001
Tolerance spaces and approximative representational structures
P Doherty, W Łukaszewicz, A Szałas
Annual Conference on Artificial Intelligence, 475-489, 2003
Tractable approximate knowledge fusion using the Horn fragment of serial propositional dynamic logic
B Dunin-Kęplicz, LA Nguyen, A Szałas
International journal of approximate reasoning 51 (3), 346-362, 2010
Logical foundations and complexity of 4QL, a query language with unrestricted negation
J Maluszyński, A Szalas
Journal of Applied Non-Classical Logics 21 (2), 211-232, 2011
Using contextually closed queries for local closed-world reasoning in rough knowledge databases
P Doherty, J Kachniarz, A Szalas
Rough-Neural Computing, 219-250, 2004
Elimination of predicate quantifiers
A Nonnengart, HJ Ohlbach, A Szałas
Logic, Language and Reasoning, 149-171, 1999
Partiality and inconsistency in agents’ belief bases
J Małuszynski, A Szałas
KES-AMSTA, Frontiers of Artificial Intelligence and Applications 252, 3-17, 2013
Towards a framework for approximate ontologies
P Doherty, M Grabowski, W Łukaszewicz, A Szałas
Fundamenta Informaticae 57 (2-4), 147-165, 2003
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20