Miroslaw Truszczynski

According to our database1, Miroslaw Truszczynski authored at least 237 papers between 1980 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
New Models for Generating Hard Random Boolean Formulas and Disjunctive Logic Programs.
CoRR, 2018

A Generator of Hard 2QBF Formulas and ASP Programs.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided?
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Maximin Share Allocations on Cycles.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Preference Learning and Optimization for Partial Lexicographic Preference Forests over Combinatorial Domains.
Proceedings of the Foundations of Information and Knowledge Systems, 2018

2017
Generating Hard Random Boolean Formulas and Disjunctive Logic Programs.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
Packing analogue of k-radius sequences.
Eur. J. Comb., 2016

First Order Logic with Inductive Definitions for Model-Based Problem Solving.
AI Magazine, 2016

Answer Set Programming: An Introduction to the Special Issue.
AI Magazine, 2016

On abstract modular inference systems and solvers.
Artif. Intell., 2016

Learning Importance of Preferences.
Proceedings of the GCAI 2016. 2nd Global Conference on Artificial Intelligence, September 19, 2016

Learning Partial Lexicographic Preference Trees and Forests over Multi-Valued Attributes.
Proceedings of the GCAI 2016. 2nd Global Conference on Artificial Intelligence, September 19, 2016

2015
On equivalence of infinitary formulas under the stable model semantics.
TPLP, 2015

Dual-normal logic programs - the forgotten class.
TPLP, 2015

Dual-normal Logic Programs - the Forgotten Class.
CoRR, 2015

Towards More Efficient Requirements Formalization: A Study.
Proceedings of the Requirements Engineering: Foundation for Software Quality, 2015

A Glimpse on Gerhard Brewka's Contributions to Artificial Intelligence.
Proceedings of the Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation, 2015

Manipulation and Bribery When Aggregating Ranked Preferences.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

Reasoning with Preference Trees over Combinatorial Domains.
Proceedings of the Algorithmic Decision Theory - 4th International Conference, 2015

Learning Partial Lexicographic Preference Trees over Combinatorial Domains.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

An Abstract View on Modularity in Knowledge Representation.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
A Measure of Arbitrariness in Abductive Explanations.
TPLP, 2014

On Equivalence of Infinitary Formulas under the Stable Model Semantics.
CoRR, 2014

The Computational Complexity of Dominance and Consistency in CP-Nets.
CoRR, 2014

A Measure of Arbitrariness in Abductive Explanations.
CoRR, 2014

Answer-Set Programming in Requirements Engineering.
Proceedings of the Requirements Engineering: Foundation for Software Quality, 2014

Abstract Modular Inference Systems and Solvers.
Proceedings of the Practical Aspects of Declarative Languages, 2014

Manipulation and Bribery in Preference Reasoning under Pareto Principle.
Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

Preference Trees: A Language for Representing and Reasoning about Qualitative Preferences.
Proceedings of the Multidisciplinary Workshop on Advances in Preference Handling, 2014

2013
Strong Equivalence of Qualitative Optimization Problems.
J. Artif. Intell. Res., 2013

Abstract Modular Systems and Solvers.
CoRR, 2013

The View-Update Problem for Indefinite Databases.
Proceedings of the 21st Italian Symposium on Advanced Database Systems, 2013

On Optimal Solutions of Answer Set Optimization Problems.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2013

Implementing Informal Semantics of ASP.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2013

On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2013

Aggregating Conditionally Lexicographic Preferences Using Answer Set Programming Solvers.
Proceedings of the Algorithmic Decision Theory - Third International Conference, 2013

Modular Answer Set Solving.
Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

Abstract Preference Frameworks - a Unifying Perspective on Separability and Strong Equivalence.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2012
Constructions of asymptotically shortest k-radius sequences.
J. Comb. Theory, Ser. A, 2012

The View-Update Problem for Indefinite Databases
CoRR, 2012

Weighted-Sequence Problem: ASP vs CASP and Declarative vs Problem-Oriented Solving.
Proceedings of the Practical Aspects of Declarative Languages, 2012

Temporal Action Language (TAL): A Controlled Language for Consistency Checking of Natural Language Temporal Requirements - (Preliminary Results).
Proceedings of the NASA Formal Methods, 2012

Strong Equivalence of Qualitative Optimization Problems.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Thirteenth International Conference, 2012

The View-Update Problem for Indefinite Databases.
Proceedings of the Logics in Artificial Intelligence - 13th European Conference, 2012

A Tarskian Informal Semantics for Answer Set Programming.
Proceedings of the Technical Communications of the 28th International Conference on Logic Programming, 2012

Connecting First-Order ASP and the Logic FO(ID) through Reducts.
Proceedings of the Correct Reasoning, 2012

2011
Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs.
TPLP, 2011

Transition systems for model generators - A unifying approach.
TPLP, 2011

Active integrity constraints and revision programming.
TPLP, 2011

On graph equivalences preserved under extensions.
Discrete Mathematics, 2011

Strong Equivalence of Qualitative Optimization Problems
CoRR, 2011

Properties and Applications of Programs with Monotone and Convex Constraints
CoRR, 2011

Origins of Answer-Set Programming - Some Background And Two Personal Accounts
CoRR, 2011

Revisiting Epistemic Specifications
CoRR, 2011

Reiter's Default Logic Is a Logic of Autoepistemic Reasoning And a Good One, Too
CoRR, 2011

Transition Systems for Model Generators - A Unifying Approach
CoRR, 2011

Answer set programming at a glance.
Commun. ACM, 2011

Revisiting Epistemic Specifications.
Proceedings of the Logic Programming, Knowledge Representation, and Nonmonotonic Reasoning, 2011

2010
Active Integrity Constraints and Revision Programming
CoRR, 2010

Trichotomy and Dichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs
CoRR, 2010

Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs.
Artif. Intell., 2010

Logic programs with abstract constraint atoms: The role of computations.
Artif. Intell., 2010

Simple but Hard Mixed Horn Formulas.
Proceedings of the Theory and Applications of Satisfiability Testing, 2010

Representing Preferences Among Sets.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Relativized hyperequivalence of logic programs for modular programming.
TPLP, 2009

Relativized hyperequivalence of logic programs for modular programming
CoRR, 2009

Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

Simple Random Logic Programs.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

The Second Answer Set Programming Competition.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs.
Proceedings of the Logic Programming, 25th International Conference, 2009

2008
Nonmonotonic Reasoning.
Proceedings of the Handbook of Knowledge Representation, 2008

Approximation Schemes in Logic and Artificial Intelligence.
Trans. Rough Sets, 2008

Logic programs with monotone abstract constraint atoms.
TPLP, 2008

The Computational Complexity of Dominance and Consistency in CP-Nets.
J. Artif. Intell. Res., 2008

On the number of minimal transversals in 3-uniform hypergraphs.
Discrete Mathematics, 2008

Hyperequivalence of logic programs with respect to supported models.
Ann. Math. Artif. Intell., 2008

My six encounters with Victor Marek - a personal account.
Ann. Math. Artif. Intell., 2008

Preface.
Ann. Math. Artif. Intell., 2008

Preferences and Nonmonotonic Reasoning.
AI Magazine, 2008

Declarative Semantics for Revision Programming and Connections to Active Integrity Constraints.
Proceedings of the Logics in Artificial Intelligence, 11th European Conference, 2008

Hyperequivalence of Programs and Operators.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2008

Relativized Hyperequivalence of Logic Programs for Modular Programming.
Proceedings of the Logic Programming, 24th International Conference, 2008

Declarative Semantics for Active Integrity Constraints.
Proceedings of the Logic Programming, 24th International Conference, 2008

Hyperequivalence of Logic Programs with Respect to Supported Models.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Satisfiability Testing of Boolean Combinations of Pseudo-Boolean Constraints using Local-search Techniques.
Constraints, 2007

Rough Sets and Approximation Schemes.
Proceedings of the Rough Sets and Intelligent Systems Paradigms, International Conference, 2007

An Smodels System with Limited Lookahead Computation.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2007

The First Answer Set Programming System Competition.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2007

Logic Programming for Knowledge Representation.
Proceedings of the Logic Programming, 23rd International Conference, 2007

Logic Programs with Abstract Constraint Atoms: The Role of Computations.
Proceedings of the Logic Programming, 23rd International Conference, 2007

Towards Debugging of Answer-Set Programs in the Language PSpb.
Proceedings of the 2007 International Conference on Artificial Intelligence, 2007

The Modal Logic S4F, the Default Logic, and the Logic Here-and-There.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Computing minimal models, stable models and answer sets.
TPLP, 2006

Predicate-calculus-based logics for modeling and solving search problems.
ACM Trans. Comput. Log., 2006

Properties and Applications of Programs with Monotone and Convex Constraints.
J. Artif. Intell. Res., 2006

Logic programs with monotone abstract constraint atoms
CoRR, 2006

Strong and uniform equivalence of nonmonotonic theories - an algebraic approach.
Ann. Math. Artif. Intell., 2006

Tools for modeling and solving search problems.
AI Commun., 2006

Strong and Uniform Equivalence of Nonmonotonic Theories - An Algebraic Approach.
Proceedings of the Proceedings, 2006

Strong Equivalence of Nonmonotonic Theories -- an Algebraic Approach.
Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2006

Generating Cellular Puzzles with Logic Programs.
Proceedings of the 2006 International Conference on Artificial Intelligence, 2006

Nonmonotonic Logics and Their Algebraic Foundations.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

Local-Search Techniques for Boolean Combinations of Pseudo-Boolean Constraints.
Proceedings of the Proceedings, 2006

2005
Computing minimal models, stable models and answer sets
CoRR, 2005

Approximating Answer Sets of Unitary Lifschitz-Woo Programs.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2005

Pbmodels - Software to Compute Stable Models by Pseudoboolean Solvers.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2005

The computational complexity of dominance and consistency in CP-nets.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

05171 Abstracts Collection - Nonmonotonic Reasoning, Answer Set Programming and Constraints.
Proceedings of the Nonmonotonic Reasoning, 2005

05171 Executive Summary - Nonmonotonic Reasoning, Answer Set Programming and Constraints.
Proceedings of the Nonmonotonic Reasoning, 2005

Properties of Programs with Monotone and Convex Constraints.
Proceedings of the Proceedings, 2005

Prioritized Component Systems.
Proceedings of the Proceedings, 2005

2004
Book review: Knowledge Representation, Reasoning and Declarative Problem Solving by Chitta Baral, Cambridge University press, 2003, ISBN 0-521-81802-8.
TPLP, 2004

Computing stable models: worst-case performance estimates.
TPLP, 2004

Constraint Lingo: towards high-level constraint programming.
Softw., Pract. Exper., 2004

Ultimate approximation and its application in nonmonotonic knowledge representation systems.
Inf. Comput., 2004

Satisfiability and Computing van der Waerden Numbers.
Electr. J. Comb., 2004

Local Search with Bootstrapping.
Proceedings of the SAT 2004, 2004

Semantics of disjunctive programs with monotone aggregates - an operator-based approach.
Proceedings of the 10th International Workshop on Non-Monotonic Reasoning (NMR 2004), 2004

Logic Programs With Monotone Cardinality Atoms.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2004

WSAT(CC) - A Fast Local-Search ASP Solver.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2004

Towards Systematic Benchmarking in Answer Set Programming: The Dagstuhl Initiative.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2004

Automatic Generation of English-language Steps in Puzzle Solving.
Proceedings of the International Conference on Artificial Intelligence, 2004

Logic Programs with Abstract Constraint Atoms.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003
Fixed-parameter complexity of semantics for logic programs.
ACM Trans. Comput. Log., 2003

Satisfiability and computing van der Waerden numbers
CoRR, 2003

Logic programs with monotone cardinality atoms
CoRR, 2003

WSAT(cc) - a fast local-search ASP solver
CoRR, 2003

Local-search techniques for propositional logic extended with cardinality constraints
CoRR, 2003

Uniform semantic treatment of default and autoepistemic logics.
Artif. Intell., 2003

Satisfiability and Computing van der Waerden Numbers.
Proceedings of the Theory and Applications of Satisfiability Testing, 2003

Answer Set Optimization.
Proceedings of the IJCAI-03, 2003

Computing Minimal Models, Stable Models, and Answer Sets.
Proceedings of the Logic Programming, 19th International Conference, 2003

Local-Search Techniques for Propositional Logic Extended with Cardinality Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2002
Computing large and small stable models.
TPLP, 2002

Propositional satisfiability in declarative programming
CoRR, 2002

Computing stable models: worst-case performance estimates
CoRR, 2002

Ultimate approximations in nonmonotonic knowledge representation systems
CoRR, 2002

Annotated revision programs.
Artif. Intell., 2002

Ultimate Approximations in Nonmonotonic Knowledge Representation Systems.
Proceedings of the Eights International Conference on Principles and Knowledge Representation and Reasoning (KR-02), 2002

Constraint Lingo: A Program for Solving Logic Puzzles and Other Tabular Constraint Problems.
Proceedings of the Logics in Artificial Intelligence, European Conference, 2002

The aspps System.
Proceedings of the Logics in Artificial Intelligence, European Conference, 2002

Computing Stable Models: Worst-Case Performance Estimates.
Proceedings of the Logic Programming, 18th International Conference, 2002

2001
On the problem of computing the well-founded semantics.
TPLP, 2001

Default logic and specification of nonmonotonic reasoning.
J. Exp. Theor. Artif. Intell., 2001

Fixed-parameter complexity of semantics for logic programs
CoRR, 2001

On the problem of computing the well-founded semantics
CoRR, 2001

aspps - an implementation of answer-set programming with propositional schemata
CoRR, 2001

Propositional satisfiability in answer-set programming
CoRR, 2001

Annotated revision programs
CoRR, 2001

aspps - An Implementation of Answer-Set Programming with Propositional Schemata.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2001

Propositional Satisfiability in Answer-Set Programming.
Proceedings of the KI 2001: Advances in Artificial Intelligence, 2001

Fixed-Parameter Complexity of Semantics for Logic Programs.
Proceedings of the Logic Programming, 17th International Conference, 2001

Tabular Constraint-Satisfaction Problems and Answer Set Programming.
Proceedings of the Answer Set Programming, 2001

Computing stable models in parallel.
Proceedings of the Answer Set Programming, 2001

More on Wire Routing with ASP.
Proceedings of the Answer Set Programming, 2001

2000
Computing large and small stable models
CoRR, 2000

DATALOG with constraints - an answer-set programming system
CoRR, 2000

Proceedings of the 8th International Workshop on Non-Monotonic Reasoning, NMR'2000
CoRR, 2000

dcs: An Implementation of DATALOG with Constraints
CoRR, 2000

On the accuracy and running time of GSAT
CoRR, 2000

Uniform semantic treatment of default and autoepistemic logics
CoRR, 2000

Uniform semantic treatment of default and autoepistemic logic.
Proceedings of the KR 2000, 2000

On the Problem of Computing the Well-Founded Semantics.
Proceedings of the Computational Logic, 2000

DATALOG with Constraints - An Answer-Set Programming System.
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30, 2000

1999
Extremal Problems in Logic Programming and Stable Model Computation.
J. Log. Program., 1999

Contributions to the Theory of Rough Sets.
Fundam. Inform., 1999

Representation Theory for Default Logic
CoRR, 1999

Extremal problems in logic programming and stable model computation
CoRR, 1999

Fixpoint 3-valued semantics for autoepistemic logic
CoRR, 1999

Computing with Default Logic.
Artif. Intell., 1999

Annotated Revision Programs.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1999

Computing Large and Small Stable Models.
Proceedings of the Logic Programming: The 1999 International Conference, Las Cruces, New Mexico, USA, November 29, 1999

On the Accuracy and Running Time of GSAT.
Proceedings of the Progress in Artificial Intelligence, 1999

The rectilinear Steiner tree problem: algorithms and examples using permutations of the terminal set.
ACM Southeast Regional Conference, 1999

1998
Revision Programming.
Theor. Comput. Sci., 1998

Stable models and an alternative logic programming paradigm
CoRR, 1998

Rough Sets - What Are They About?
Proceedings of the Rough Sets and Current Trends in Computing, 1998

Revision Programming = Logic Programming + Integrity Constraints.
Proceedings of the Computer Science Logic, 12th International Workshop, 1998

Simulating patients with Parallel Health State Networks.
Proceedings of the AMIA 1998, 1998

Fixpoint 3-Valued Semantics for Autoepistemic Logic.
Proceedings of the Fifteenth National Conference on Artificial Intelligence and Tenth Innovative Applications of Artificial Intelligence Conference, 1998

1997
A note on local colorings of graphs.
Discrete Mathematics, 1997

Representation Theory for Default Logic.
Ann. Math. Artif. Intell., 1997

Automated Reasoning with Non-Monotonic Logics (Abstract).
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1997

Intelligent Computation of Presentation Documents.
Proceedings of the Foundations of Intelligent Systems, 10th International Symposium, 1997

1996
Nonmonotonic Reasoning is Sometimes Simpler!
J. Log. Comput., 1996

Approximating the Stable Model Semantics is Hard.
Fundam. Inform., 1996

Default Reasoning System DeReS.
Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96), 1996

Infinitary Default Logic for Specification of Nonmonotonic Reasoning.
Proceedings of the Logics in Artificial Intelligence, European Workshop, 1996

Extremal Problems in Logic Programming and Stable Model Computation.
Proceedings of the Logic Programming, 1996

1995
Complexity of Computing with Extended Propositional Logic Programs.
Ann. Math. Artif. Intell., 1995

Algorithms for Maintaining Authorization Bases.
OOIS, 1995

Skeptical Rational Extensions.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 1995

Constrained and Rational Default Logics.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

Experimenting with Nonmonotonic Reasoning.
Proceedings of the Logic Programming, 1995

Revision Programming, Database Updates and Integrity Constraints.
Proceedings of the Database Theory, 1995

1994
Minimal Knowledge Problem: A New Approach.
Artif. Intell., 1994

Revision Specifications by Means of Programs.
Proceedings of the Logics in Artificial Intelligence, European Workshop, 1994

1993
Modal Nonmonotonic Logics: Ranges, Characterization, Computation.
J. ACM, 1993

Rational Default Logic and Disjunctive Logic Programming.
Proceedings of the Logic Programming and Non-monotonic Reasoning, 1993

Reflective Autoepistemic Logic and Logic Programming.
Proceedings of the Logic Programming and Non-monotonic Reasoning, 1993

Nonmonotonic Reasoning is Sometimes Simpler.
Proceedings of the Computational Logic and Proof Theory, Third Kurt Gödel Colloquium, 1993

Subnormal Modal Logics for Knowledge Representation.
Proceedings of the 11th National Conference on Artificial Intelligence. Washington, 1993

Nonmonotonic logic - context-dependent reasoning.
Artificial intelligence, Springer, ISBN: 0-387-56448-9, 1993

1992
The Pure Logic of Necessitation.
J. Log. Comput., 1992

Generalized local colorings of graphs.
J. Comb. Theory, Ser. B, 1992

More on modal aspects of default logic.
Fundam. Inform., 1992

Rado's selection principle: applications to binary relations, graph and hypergraph colorings and partially ordered sets.
Discrete Mathematics, 1992

Indexing functions and time lower bounds for sorting on a mesh-connected computer.
Discrete Applied Mathematics, 1992

Modal Logic S4F and The Minimal Knowledge Paradigm.
Proceedings of the 4th Conference on Theoretical Aspects of Reasoning about Knowledge, 1992

Complexity of Computing with Extended Propositional Logic Programs.
Proceedings of the Informal Proceedings of the Workshop Structural Complexity and Recursion-theoretic methods in Logic-Programming, 1992

An algorithm for embedding a class of non-even routing problems in even routing problems.
Proceedings of the Second Great Lakes Symposium on VLSI, 1992

1991
Autoepistemic Logic.
J. ACM, 1991

Modal nonmonotonic logic with restricted application of the negation as failure to prove rule.
Fundam. Inform., 1991

Asymptotic results on saturated graphs.
Discrete Mathematics, 1991

Decompositions of graphs into forests with bounded maximum degree.
Discrete Mathematics, 1991

Decompositions of regular bipartite graphs.
Discrete Mathematics, 1991

Primal graphs with small degrees.
Discrete Mathematics, 1991

Normal Form Results for Default Logic.
Proceedings of the Nonmonotonic and Inductive Logic, 1991

Embedding Default Logic into Modal Nonmonotonic Logics.
Proceedings of the Logic Programming and Non-monotonic Reasoning, 1991

Computing Intersection of Autoepistemic Expansions.
Proceedings of the Logic Programming and Non-monotonic Reasoning, 1991

Modal Nonmonotonic Logics: Ranges, Characterization, Computation.
Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR'91). Cambridge, 1991

Disjective Defaults.
Proceedings of the 2nd International Conference on Principles of Knowledge Representation and Reasoning (KR'91). Cambridge, 1991

Modal Interpretations of Default Logic.
Proceedings of the 12th International Joint Conference on Artificial Intelligence. Sydney, 1991

Routing non-convex grids without holes.
Proceedings of the First Great Lakes Symposium on VLSI, 1991

1990
Modal Logic for Default Reasoning.
Ann. Math. Artif. Intell., 1990

Ranges of Strong Modal Nonmonotonic Logics.
Proceedings of the Nonmonotonic and Inductive Logic, 1990

Modal Nonmonotonic Logic with Restricted Application of the Negation as Failure to Prove Rule.
Proceedings of the Workshop Logic Programming and Non-Monotonic Logic, 1990

1989
Stable Semantics for Logic Programs and Default Theories.
Proceedings of the Logic Programming, 1989

Relating Autoepistemic and Default Logics.
Proceedings of the 1st International Conference on Principles of Knowledge Representation and Reasoning (KR'89). Toronto, 1989

1987
Linear upper bounds for local Ramsey numbers.
Graphs and Combinatorics, 1987

1985
Note on the decomposition of lambdaKm, n (lambdaKm, n*) into paths.
Discrete Mathematics, 1985

1981
Algorithmic aspects of the attribute set minimization problem.
Fundam. Inform., 1981

On Admissible Families of Sets.
FODO, 1981

Optimal F-Graphs for the Family of all K-Subsets of an N-Set.
FODO, 1981

Optimal F-Graphs for Balanced Families of Sets.
FODO, 1981

1980
Once More on Storage for Consecutive Retrieval.
Inf. Process. Lett., 1980

An algorithm of finding an acyclic f-graph for a family od sets.
Fundam. Inform., 1980


  Loading...