Paulo A. S. Veloso

According to our database1, Paulo A. S. Veloso authored at least 78 papers between 1977 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
De Zolt's postulate: an Abstract Approach.
Rev. Symb. Log., 2022

2018
On Diagrams and General Model Checkers.
Proceedings of the Diagrammatic Representation and Inference, 2018

2017
On a graph calculus for modalities.
Theor. Comput. Sci., 2017

2015
On Graphs for Intuitionistic Modal Logics.
Proceedings of the Tenth Workshop on Logical and Semantic Frameworks, with Applications, 2015

2014
PDL for structured data: a graph-calculus approach.
Log. J. IGPL, 2014

On Graph Calculi for Multi-modal Logics.
Proceedings of the Ninth Workshop on Logical and Semantic Frameworks, with Applications, 2014

2013
On a Graph Approach to Modal Logics.
Proceedings of the 8th Workshop on Logical and Semantic Frameworks, 2013

2012
A Graph Calculus for Predicate Logic
Proceedings of the Proceedings Seventh Workshop on Logical and Semantic Frameworks, 2012

2011
On Graph Refutation for Relational Inclusions
Proceedings of the Proceedings 6th Workshop on Logical and Semantic Frameworks with Applications, 2011

2010
Modeling interactive storytelling genres as application domains.
J. Intell. Inf. Syst., 2010

On vague notions and modalities: a modular approach.
Log. J. IGPL, 2010

A Tool for Analysing Logics.
Proceedings of the Fifth Logical and Semantic Frameworks, with Applications Workshop, 2010

A Calculus for Graphs with Complement.
Proceedings of the Diagrammatic Representation and Inference, 6th International Conference, 2010

2009
On graph reasoning.
Inf. Comput., 2009

Positive Fork Graph Calculus.
Proceedings of the Logical Foundations of Computer Science, International Symposium, 2009

2008
On a Graph Calculus for Algebras of Relations.
Proceedings of the Logic, 2008

Methodical Construction of Symbolic Diagrams.
Proceedings of the Advances in Artificial Intelligence, 2008

2007
On Fork Arrow Logic and its Expressive Power.
J. Philos. Log., 2007

Natural Deduction for "Generally".
Log. J. IGPL, 2007

On Positive Relational Calculi.
Log. J. IGPL, 2007

Sequent Calculi for 'Generally'.
Proceedings of the Second Workshop on Logical and Semantic Frameworks, with Applications, 2007

2006
Reasoning with Graphs.
Proceedings of the 13th Workshop on Logic, Language, Information and Computation, 2006

2005
An Application of Logic Engineering.
Log. J. IGPL, 2005

On 'Most' and 'Representative': Filter Logic and Special Predicates.
Log. J. IGPL, 2005

Exploring Computational Contents of Intuitionist Proofs.
Log. J. IGPL, 2005

2004
Logics For Qualitative Reasoning.
Proceedings of the Logic, Epistemology, and the Unity of Science, 2004

On Ultrafilter Logic and Special Functions.
Stud Logica, 2004

Functional Interpretation of Logics for 'Generally'.
Log. J. IGPL, 2004

On Modalities for Vague Notions.
Proceedings of the Advances in Artificial Intelligence - SBIA 2004, 17th Brazilian Symposium on Artificial Intelligence, São Luis, Maranhão, Brazil, September 29, 2004

2003
Squares in Fork Arrow Logic.
J. Philos. Log., 2003

2002
On local modularity and interpolation in entailment systems.
Inf. Process. Lett., 2002

On Special Functions and Theorem Proving in Logics for 'Generally'.
Proceedings of the Advances in Artificial Intelligence, 2002

Qualitative Logic for 'Generally'.
Proceedings of the International Conference on Artificial Intelligence, 2002

2001
On local modularity variants and -institutions.
Inf. Process. Lett., 2001

2000
A Formal Framework for Modelling at the Behavioural Level.
Proceedings of the Information Modelling and Knowledge Bases XII: Tenth European-Japanese Conference on Information Modelling and Knowledge Bases, 2000

1998
Labeled Families in Modular Software Development.
J. Braz. Comput. Soc., 1998

1997
On Methods for Safe Introduction of Operations.
Inf. Process. Lett., 1997

A Finite Axiomatization for Fork Algebras.
Log. J. IGPL, 1997

Ultrafilter Logic and Generic Reasoning.
Proceedings of the Computational Logic and Proof Theory, 5th Kurt Gödel Colloquium, 1997

Fork Algebras.
Proceedings of the Relational Methods in Computer Science., 1997

1996
On Pushout Consistency, Modularity and Interpolation for Logical Specifications.
Inf. Process. Lett., 1996

1995
On the Modularization Theorem for Logical Specifications.
Inf. Process. Lett., 1995

Definition-like Extensions by Sorts.
Log. J. IGPL, 1995

1993
A New, Simpler Proof of the Modularisation Theorem for Logical Specifications.
Log. J. IGPL, 1993

Sobre o Teorema da Modularização: Importância e uma Prova por Quociente.
Proceedings of the 7th Brazilian Symposium on Software Engineering, 1993

Comparing Two Different Approaches to Products in Abstract Relation Algebra.
Proceedings of the Algebraic Methodology and Software Technology (AMAST '93), 1993

1992
Yet Antother Cautionary Note on Conservative Extensions: a Simple Case with a Computing Flavour.
Bull. EATCS, 1992

1991
Some Remarks on Conservative Extensions: A Socratic Dialogue.
Bull. EATCS, 1991

1990
Uma metodologia para cálculo da complexidade de algoritmos.
Proceedings of the 4th Brazilian Symposium on Software Engineering, 1990

1989
A Programação Dinâmica: um caso particular da Divisão e Conquista.
RITA, 1989

Desenvolvimento de Algoritmos Aproximativos por Acercamento: Especificação Formal.
Proceedings of the 3rd Brazilian Symposium on Software Engineering, 1989

1988
Iteration for applicative languages.
ACM SIGPLAN Notices, 1988

Programação Dinâmica e Método Guloso.
Proceedings of the 2nd Brazilian Symposium on Software Engineering, 1988

1987
On the concepts of problem and problem-solving method.
Decis. Support Syst., 1987

1986
Towards simpler and yet complete formal specificapions.
Proceedings of the Trends in Information Systems, 1986

1985
Towards Simpler and Yet Complete Formal Specifications
Proceedings of the Information Systems - Theoretical and Formal Aspects, 1985

A Theory of Abstract Data Types for Program Development: Bridging the Gap?
Proceedings of the Mathematical Foundations of Software Development, 1985

1984
Formal Data Base Specification - An Eclectic Perspective.
Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1984

The Data Transform Programming Metho: An Example for File Processing Problems.
Proceedings of the Proceedings, 1984

Logical Specification and Implementation.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1984

1983
Multi-level specifications based on traces.
ACM SIGSOFT Softw. Eng. Notes, 1983

A Grammatical Approach to Data Bases.
Proceedings of the Information Processing 83, 1983

View Constructs for the Specification and Design of External Schemas.
Proceedings of the 3rd Int. Conf. on Entity-Relationship Approach (ER'83), 1983

Problems as Abstract Data Types: Applications to Program Construction.
Proceedings of the Proceedings 2nd Workshop on Abstract Data Type, 1983

1982
Methodical specification of abstract data types via rewriting systems.
Int. J. Parallel Program., 1982

Comparing data type specifications via their normal forms.
Int. J. Parallel Program., 1982

Specification of data bases through rewriting rules.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1982

Stepwise Construction of Algebraic Specifications.
Proceedings of the Advances in Data Base Theory, 1982

1981
An economical method for comparing data type specifications.
ACM SIGPLAN Notices, 1981

Procedural specifications and implementations for abstract data types.
ACM SIGPLAN Notices, 1981

Systematic Derivation of Complementary Specifications
Proceedings of the Very Large Data Bases, 1981

Verification and Testing of S-ER Representations.
Proceedings of the Entity-Relationship Approach to Information Modeling and Analysis, 1981

1980
Characterizations for the regular prefix codes and related families.
Int. J. Parallel Program., 1980

1979
Traversable stack with fewer errors: addenda and corrigenda.
ACM SIGPLAN Notices, 1979

Traversable stack with fewer errors.
ACM SIGPLAN Notices, 1979

Some Remarks on Multiple-Entry Finite Automata.
J. Comput. Syst. Sci., 1979

Characterizing the Regular Prefix Codes and Right Power-Bounded Languages.
Inf. Process. Lett., 1979

1977
Some Bounds on Quasi-Initialised Finite Automata.
Proceedings of the International Computing Symposium 1977, 1977


  Loading...